./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8d964de1f9939284b07a303cd6738f27ad6151a08cde6c6c589697ec126ba86
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-26 08:37:00,021 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-26 08:37:00,024 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-26 08:37:00,090 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-26 08:37:00,091 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-26 08:37:00,093 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-26 08:37:00,095 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-26 08:37:00,097 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-26 08:37:00,099 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-26 08:37:00,103 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-26 08:37:00,104 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-26 08:37:00,105 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-26 08:37:00,106 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-26 08:37:00,107 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-26 08:37:00,108 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-26 08:37:00,109 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-26 08:37:00,111 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-26 08:37:00,126 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-26 08:37:00,127 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-26 08:37:00,131 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-26 08:37:00,133 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-26 08:37:00,134 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-26 08:37:00,135 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-26 08:37:00,136 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-26 08:37:00,143 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-26 08:37:00,143 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-26 08:37:00,143 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-26 08:37:00,145 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-26 08:37:00,145 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-26 08:37:00,146 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-26 08:37:00,146 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-26 08:37:00,148 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-26 08:37:00,150 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-26 08:37:00,151 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-26 08:37:00,171 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-26 08:37:00,172 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-26 08:37:00,172 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-26 08:37:00,173 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-26 08:37:00,173 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-26 08:37:00,174 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-26 08:37:00,174 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-26 08:37:00,175 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-26 08:37:00,211 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-26 08:37:00,211 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-26 08:37:00,212 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-26 08:37:00,212 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-26 08:37:00,213 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-26 08:37:00,213 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-26 08:37:00,214 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-26 08:37:00,214 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-26 08:37:00,215 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-26 08:37:00,215 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-26 08:37:00,216 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-26 08:37:00,216 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-26 08:37:00,216 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-26 08:37:00,217 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-26 08:37:00,217 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-26 08:37:00,217 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-26 08:37:00,217 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-26 08:37:00,218 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-26 08:37:00,218 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-26 08:37:00,218 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-26 08:37:00,218 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-26 08:37:00,218 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-26 08:37:00,219 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-26 08:37:00,219 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-26 08:37:00,219 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-26 08:37:00,219 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-26 08:37:00,220 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:37:00,220 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-26 08:37:00,220 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-26 08:37:00,221 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-26 08:37:00,221 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-26 08:37:00,221 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-26 08:37:00,222 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-26 08:37:00,222 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-26 08:37:00,223 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-26 08:37:00,223 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-26 08:37:00,223 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-26 08:37:00,223 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8d964de1f9939284b07a303cd6738f27ad6151a08cde6c6c589697ec126ba86
[2023-10-26 08:37:00,612 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-26 08:37:00,651 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-26 08:37:00,653 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-26 08:37:00,654 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-26 08:37:00,655 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-26 08:37:00,656 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2023-10-26 08:37:02,366 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-26 08:37:02,767 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-26 08:37:02,774 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2023-10-26 08:37:02,796 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/befd592b3/a4eb922a5293496db57c8cf0d07044e2/FLAG68a485ee4
[2023-10-26 08:37:02,819 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/befd592b3/a4eb922a5293496db57c8cf0d07044e2
[2023-10-26 08:37:02,821 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-26 08:37:02,830 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-26 08:37:02,831 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-26 08:37:02,832 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-26 08:37:02,834 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-26 08:37:02,840 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:37:02" (1/1) ...
[2023-10-26 08:37:02,846 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3524d03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:02, skipping insertion in model container
[2023-10-26 08:37:02,846 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:37:02" (1/1) ...
[2023-10-26 08:37:02,868 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-26 08:37:02,922 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-26 08:37:03,180 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:37:03,577 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:37:03,583 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-26 08:37:03,618 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:37:03,674 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:37:03,750 INFO  L208         MainTranslator]: Completed translation
[2023-10-26 08:37:03,751 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03 WrapperNode
[2023-10-26 08:37:03,751 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-26 08:37:03,752 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-26 08:37:03,752 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-26 08:37:03,752 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-26 08:37:03,757 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (1/1) ...
[2023-10-26 08:37:03,809 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (1/1) ...
[2023-10-26 08:37:03,861 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2023-10-26 08:37:03,866 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-26 08:37:03,866 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-26 08:37:03,873 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-26 08:37:03,873 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-26 08:37:03,883 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (1/1) ...
[2023-10-26 08:37:03,883 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (1/1) ...
[2023-10-26 08:37:03,896 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (1/1) ...
[2023-10-26 08:37:03,896 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (1/1) ...
[2023-10-26 08:37:03,905 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (1/1) ...
[2023-10-26 08:37:03,922 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (1/1) ...
[2023-10-26 08:37:03,924 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (1/1) ...
[2023-10-26 08:37:03,925 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (1/1) ...
[2023-10-26 08:37:03,938 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-26 08:37:03,939 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-26 08:37:03,939 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-26 08:37:03,939 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-26 08:37:03,940 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (1/1) ...
[2023-10-26 08:37:03,944 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:37:03,965 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:03,988 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-26 08:37:04,028 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-26 08:37:04,053 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-26 08:37:04,054 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-26 08:37:04,054 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-26 08:37:04,057 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-26 08:37:04,057 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-26 08:37:04,057 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-26 08:37:04,057 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-26 08:37:04,057 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-26 08:37:04,057 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-26 08:37:04,057 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-26 08:37:04,058 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-26 08:37:04,059 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-26 08:37:04,261 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-26 08:37:04,263 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-26 08:37:04,722 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-26 08:37:04,728 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-26 08:37:04,729 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-26 08:37:04,730 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:37:04 BoogieIcfgContainer
[2023-10-26 08:37:04,731 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-26 08:37:04,732 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-26 08:37:04,732 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-26 08:37:04,734 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-26 08:37:04,752 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:37:02" (1/3) ...
[2023-10-26 08:37:04,753 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38294e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:37:04, skipping insertion in model container
[2023-10-26 08:37:04,754 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:37:03" (2/3) ...
[2023-10-26 08:37:04,754 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38294e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:37:04, skipping insertion in model container
[2023-10-26 08:37:04,754 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:37:04" (3/3) ...
[2023-10-26 08:37:04,755 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i
[2023-10-26 08:37:04,762 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-26 08:37:04,770 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-26 08:37:04,772 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2023-10-26 08:37:04,772 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-26 08:37:04,911 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-26 08:37:04,961 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-10-26 08:37:05,104 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-10-26 08:37:05,117 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:37:05,122 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-10-26 08:37:05,122 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2023-10-26 08:37:05,127 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2023-10-26 08:37:05,130 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:37:05,156 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2023-10-26 08:37:05,164 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2023-10-26 08:37:05,165 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-10-26 08:37:05,209 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-10-26 08:37:05,220 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:37:05,221 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-10-26 08:37:05,225 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2023-10-26 08:37:08,601 INFO  L134        LiptonReduction]: Checked pairs total: 9489
[2023-10-26 08:37:08,605 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2023-10-26 08:37:08,647 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:37:08,671 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24a68b05, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:37:08,672 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-10-26 08:37:08,683 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-10-26 08:37:08,684 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:37:08,684 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:08,685 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:08,686 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:37:08,690 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:08,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 1980212676, now seen corresponding path program 1 times
[2023-10-26 08:37:08,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:08,706 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147030560]
[2023-10-26 08:37:08,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:08,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:08,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:09,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:09,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:09,632 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147030560]
[2023-10-26 08:37:09,632 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147030560] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:37:09,645 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:37:09,646 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:37:09,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148893397]
[2023-10-26 08:37:09,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:37:09,654 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:37:09,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:09,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:37:09,701 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:37:10,150 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 197
[2023-10-26 08:37:10,153 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:10,153 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:10,153 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 197
[2023-10-26 08:37:10,154 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:10,452 INFO  L130       PetriNetUnfolder]: 146/507 cut-off events.
[2023-10-26 08:37:10,452 INFO  L131       PetriNetUnfolder]: For 4/8 co-relation queries the response was YES.
[2023-10-26 08:37:10,456 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 870 conditions, 507 events. 146/507 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2712 event pairs, 42 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 784. Up to 226 conditions per place. 
[2023-10-26 08:37:10,461 INFO  L137   encePairwiseOnDemand]: 181/197 looper letters, 47 selfloop transitions, 23 changer transitions 0/98 dead transitions.
[2023-10-26 08:37:10,461 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 344 flow
[2023-10-26 08:37:10,462 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:37:10,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:37:10,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions.
[2023-10-26 08:37:10,492 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5583756345177665
[2023-10-26 08:37:10,493 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 660 transitions.
[2023-10-26 08:37:10,494 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 660 transitions.
[2023-10-26 08:37:10,497 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:10,509 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 660 transitions.
[2023-10-26 08:37:10,515 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:10,523 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:10,524 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:10,535 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 660 transitions.
[2023-10-26 08:37:10,536 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 344 flow
[2023-10-26 08:37:10,539 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 344 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:37:10,541 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2023-10-26 08:37:10,542 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2023-10-26 08:37:10,545 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2023-10-26 08:37:10,548 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2023-10-26 08:37:10,549 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:10,557 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:10,558 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:10,558 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-26 08:37:10,560 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:37:10,560 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:10,561 INFO  L85        PathProgramCache]: Analyzing trace with hash 1641346575, now seen corresponding path program 1 times
[2023-10-26 08:37:10,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:10,563 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115978536]
[2023-10-26 08:37:10,563 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:10,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:10,605 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:10,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:10,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:10,901 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115978536]
[2023-10-26 08:37:10,901 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115978536] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:37:10,901 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:37:10,904 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:37:10,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727644556]
[2023-10-26 08:37:10,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:37:10,906 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:37:10,906 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:10,907 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:37:10,907 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:37:11,218 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 197
[2023-10-26 08:37:11,219 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 292 flow. Second operand  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:11,219 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:11,219 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 197
[2023-10-26 08:37:11,219 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:11,636 INFO  L130       PetriNetUnfolder]: 284/850 cut-off events.
[2023-10-26 08:37:11,636 INFO  L131       PetriNetUnfolder]: For 332/338 co-relation queries the response was YES.
[2023-10-26 08:37:11,637 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 850 events. 284/850 cut-off events. For 332/338 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5116 event pairs, 51 based on Foata normal form. 5/813 useless extension candidates. Maximal degree in co-relation 1873. Up to 398 conditions per place. 
[2023-10-26 08:37:11,641 INFO  L137   encePairwiseOnDemand]: 174/197 looper letters, 73 selfloop transitions, 50 changer transitions 0/152 dead transitions.
[2023-10-26 08:37:11,641 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 152 transitions, 799 flow
[2023-10-26 08:37:11,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:37:11,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:37:11,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions.
[2023-10-26 08:37:11,659 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5439932318104906
[2023-10-26 08:37:11,659 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 643 transitions.
[2023-10-26 08:37:11,659 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions.
[2023-10-26 08:37:11,660 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:11,660 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions.
[2023-10-26 08:37:11,661 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:11,663 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:11,663 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:11,664 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 6 states and 643 transitions.
[2023-10-26 08:37:11,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 152 transitions, 799 flow
[2023-10-26 08:37:11,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 152 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:37:11,673 INFO  L231             Difference]: Finished difference. Result has 79 places, 129 transitions, 770 flow
[2023-10-26 08:37:11,673 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=770, PETRI_PLACES=79, PETRI_TRANSITIONS=129}
[2023-10-26 08:37:11,675 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places.
[2023-10-26 08:37:11,675 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 129 transitions, 770 flow
[2023-10-26 08:37:11,676 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:11,676 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:11,676 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:11,677 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-26 08:37:11,677 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:37:11,677 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:11,677 INFO  L85        PathProgramCache]: Analyzing trace with hash 61135557, now seen corresponding path program 1 times
[2023-10-26 08:37:11,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:11,678 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971124879]
[2023-10-26 08:37:11,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:11,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:11,698 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:12,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:12,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:12,075 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971124879]
[2023-10-26 08:37:12,075 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971124879] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:37:12,076 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:37:12,076 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:37:12,077 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921893297]
[2023-10-26 08:37:12,077 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:37:12,077 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:37:12,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:12,078 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:37:12,079 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:37:12,508 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197
[2023-10-26 08:37:12,509 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 129 transitions, 770 flow. Second operand  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:12,509 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:12,509 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197
[2023-10-26 08:37:12,509 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:12,751 INFO  L130       PetriNetUnfolder]: 280/858 cut-off events.
[2023-10-26 08:37:12,751 INFO  L131       PetriNetUnfolder]: For 1118/1126 co-relation queries the response was YES.
[2023-10-26 08:37:12,752 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 858 events. 280/858 cut-off events. For 1118/1126 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5295 event pairs, 47 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 2418. Up to 429 conditions per place. 
[2023-10-26 08:37:12,755 INFO  L137   encePairwiseOnDemand]: 186/197 looper letters, 76 selfloop transitions, 33 changer transitions 8/171 dead transitions.
[2023-10-26 08:37:12,755 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 1243 flow
[2023-10-26 08:37:12,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:37:12,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:37:12,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions.
[2023-10-26 08:37:12,757 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5651438240270727
[2023-10-26 08:37:12,757 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 668 transitions.
[2023-10-26 08:37:12,757 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions.
[2023-10-26 08:37:12,758 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:12,758 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions.
[2023-10-26 08:37:12,759 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:12,761 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:12,774 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:12,774 INFO  L175             Difference]: Start difference. First operand has 79 places, 129 transitions, 770 flow. Second operand 6 states and 668 transitions.
[2023-10-26 08:37:12,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 171 transitions, 1243 flow
[2023-10-26 08:37:12,778 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 171 transitions, 1243 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:37:12,786 INFO  L231             Difference]: Finished difference. Result has 89 places, 159 transitions, 1135 flow
[2023-10-26 08:37:12,787 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1135, PETRI_PLACES=89, PETRI_TRANSITIONS=159}
[2023-10-26 08:37:12,788 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2023-10-26 08:37:12,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 159 transitions, 1135 flow
[2023-10-26 08:37:12,788 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:12,788 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:12,788 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:12,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-26 08:37:12,792 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:37:12,792 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:12,792 INFO  L85        PathProgramCache]: Analyzing trace with hash -1282532369, now seen corresponding path program 1 times
[2023-10-26 08:37:12,792 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:12,793 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323600505]
[2023-10-26 08:37:12,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:12,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:12,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:13,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:13,203 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:13,204 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323600505]
[2023-10-26 08:37:13,204 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323600505] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:37:13,204 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:37:13,204 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:37:13,204 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948114952]
[2023-10-26 08:37:13,205 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:37:13,205 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:37:13,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:13,206 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:37:13,207 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:37:13,369 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197
[2023-10-26 08:37:13,370 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 159 transitions, 1135 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:13,370 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:13,370 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197
[2023-10-26 08:37:13,370 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:13,875 INFO  L130       PetriNetUnfolder]: 536/1340 cut-off events.
[2023-10-26 08:37:13,876 INFO  L131       PetriNetUnfolder]: For 1846/1860 co-relation queries the response was YES.
[2023-10-26 08:37:13,881 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4866 conditions, 1340 events. 536/1340 cut-off events. For 1846/1860 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8489 event pairs, 92 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 4685. Up to 994 conditions per place. 
[2023-10-26 08:37:13,898 INFO  L137   encePairwiseOnDemand]: 167/197 looper letters, 167 selfloop transitions, 111 changer transitions 10/304 dead transitions.
[2023-10-26 08:37:13,898 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 304 transitions, 2365 flow
[2023-10-26 08:37:13,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:37:13,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:37:13,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 683 transitions.
[2023-10-26 08:37:13,900 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.577834179357022
[2023-10-26 08:37:13,900 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 683 transitions.
[2023-10-26 08:37:13,900 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 683 transitions.
[2023-10-26 08:37:13,902 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:13,902 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 683 transitions.
[2023-10-26 08:37:13,904 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:13,905 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:13,907 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:13,907 INFO  L175             Difference]: Start difference. First operand has 89 places, 159 transitions, 1135 flow. Second operand 6 states and 683 transitions.
[2023-10-26 08:37:13,907 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 304 transitions, 2365 flow
[2023-10-26 08:37:13,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 304 transitions, 2365 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:37:13,938 INFO  L231             Difference]: Finished difference. Result has 97 places, 262 transitions, 2045 flow
[2023-10-26 08:37:13,938 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2045, PETRI_PLACES=97, PETRI_TRANSITIONS=262}
[2023-10-26 08:37:13,939 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places.
[2023-10-26 08:37:13,939 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 262 transitions, 2045 flow
[2023-10-26 08:37:13,940 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:13,940 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:13,940 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:13,940 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-26 08:37:13,940 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:37:13,941 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:13,941 INFO  L85        PathProgramCache]: Analyzing trace with hash 1889096930, now seen corresponding path program 1 times
[2023-10-26 08:37:13,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:13,941 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339347949]
[2023-10-26 08:37:13,941 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:13,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:13,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:14,720 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:14,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:14,721 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339347949]
[2023-10-26 08:37:14,721 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339347949] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:37:14,722 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627802341]
[2023-10-26 08:37:14,722 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:14,722 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:14,722 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:14,728 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:37:14,795 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-26 08:37:14,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:14,973 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-26 08:37:14,978 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:37:15,138 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-26 08:37:15,323 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:37:15,356 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:15,357 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:37:15,425 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:15,426 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:15,427 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:37:15,483 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:15,485 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:15,485 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:15,487 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:37:15,563 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:15,564 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:37:15,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:15,608 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:37:15,663 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0))) is different from false
[2023-10-26 08:37:15,701 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0))))) is different from false
[2023-10-26 08:37:15,887 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:37:15,888 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627802341] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:37:15,888 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:37:15,888 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-26 08:37:15,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853056652]
[2023-10-26 08:37:15,890 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:37:15,890 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 08:37:15,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:15,891 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 08:37:15,891 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=459, Unknown=2, NotChecked=90, Total=650
[2023-10-26 08:37:16,038 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 197
[2023-10-26 08:37:16,039 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 262 transitions, 2045 flow. Second operand  has 26 states, 26 states have (on average 61.57692307692308) internal successors, (1601), 26 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:16,039 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:16,039 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 197
[2023-10-26 08:37:16,039 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:17,274 INFO  L130       PetriNetUnfolder]: 631/1461 cut-off events.
[2023-10-26 08:37:17,289 INFO  L131       PetriNetUnfolder]: For 3916/3922 co-relation queries the response was YES.
[2023-10-26 08:37:17,292 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6505 conditions, 1461 events. 631/1461 cut-off events. For 3916/3922 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9098 event pairs, 154 based on Foata normal form. 10/1371 useless extension candidates. Maximal degree in co-relation 6378. Up to 1331 conditions per place. 
[2023-10-26 08:37:17,298 INFO  L137   encePairwiseOnDemand]: 187/197 looper letters, 304 selfloop transitions, 12 changer transitions 12/330 dead transitions.
[2023-10-26 08:37:17,304 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 330 transitions, 3086 flow
[2023-10-26 08:37:17,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-10-26 08:37:17,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-10-26 08:37:17,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2023-10-26 08:37:17,307 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3598984771573604
[2023-10-26 08:37:17,307 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2023-10-26 08:37:17,307 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2023-10-26 08:37:17,307 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:17,307 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2023-10-26 08:37:17,309 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 70.9) internal successors, (709), 10 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:17,319 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:17,319 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:17,333 INFO  L175             Difference]: Start difference. First operand has 97 places, 262 transitions, 2045 flow. Second operand 10 states and 709 transitions.
[2023-10-26 08:37:17,333 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 330 transitions, 3086 flow
[2023-10-26 08:37:17,369 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 330 transitions, 2942 flow, removed 72 selfloop flow, removed 0 redundant places.
[2023-10-26 08:37:17,373 INFO  L231             Difference]: Finished difference. Result has 107 places, 265 transitions, 1941 flow
[2023-10-26 08:37:17,373 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1941, PETRI_PLACES=107, PETRI_TRANSITIONS=265}
[2023-10-26 08:37:17,375 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places.
[2023-10-26 08:37:17,375 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 265 transitions, 1941 flow
[2023-10-26 08:37:17,376 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 61.57692307692308) internal successors, (1601), 26 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:17,376 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:17,376 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:17,396 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-10-26 08:37:17,580 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:17,581 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:37:17,581 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:17,581 INFO  L85        PathProgramCache]: Analyzing trace with hash 109794428, now seen corresponding path program 1 times
[2023-10-26 08:37:17,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:17,582 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568785143]
[2023-10-26 08:37:17,582 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:17,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:17,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:18,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:18,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:18,137 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568785143]
[2023-10-26 08:37:18,137 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568785143] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:37:18,137 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817776560]
[2023-10-26 08:37:18,138 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:18,138 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:18,138 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:18,139 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:37:18,184 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-26 08:37:18,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:18,303 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 28 conjunts are in the unsatisfiable core
[2023-10-26 08:37:18,309 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:37:18,337 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-26 08:37:18,414 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:37:18,439 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:37:18,492 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:18,493 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:37:18,551 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:18,565 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:37:18,641 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:18,642 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:37:18,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:18,670 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:37:18,690 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:37:18,761 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:37:18,786 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-10-26 08:37:18,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-26 08:37:18,869 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [817776560] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:37:18,869 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:37:18,869 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21
[2023-10-26 08:37:18,869 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483960881]
[2023-10-26 08:37:18,869 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:37:18,870 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2023-10-26 08:37:18,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:18,886 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2023-10-26 08:37:18,886 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=304, Unknown=3, NotChecked=114, Total=506
[2023-10-26 08:37:19,032 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 197
[2023-10-26 08:37:19,034 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 265 transitions, 1941 flow. Second operand  has 23 states, 23 states have (on average 59.869565217391305) internal successors, (1377), 23 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:19,034 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:19,034 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 197
[2023-10-26 08:37:19,034 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:22,647 INFO  L130       PetriNetUnfolder]: 720/1653 cut-off events.
[2023-10-26 08:37:22,648 INFO  L131       PetriNetUnfolder]: For 3859/3865 co-relation queries the response was YES.
[2023-10-26 08:37:22,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7496 conditions, 1653 events. 720/1653 cut-off events. For 3859/3865 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10567 event pairs, 75 based on Foata normal form. 2/1572 useless extension candidates. Maximal degree in co-relation 7351. Up to 979 conditions per place. 
[2023-10-26 08:37:22,676 INFO  L137   encePairwiseOnDemand]: 146/197 looper letters, 279 selfloop transitions, 236 changer transitions 41/558 dead transitions.
[2023-10-26 08:37:22,676 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 558 transitions, 4800 flow
[2023-10-26 08:37:22,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-26 08:37:22,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-26 08:37:22,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1554 transitions.
[2023-10-26 08:37:22,686 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3756345177664975
[2023-10-26 08:37:22,686 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1554 transitions.
[2023-10-26 08:37:22,686 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1554 transitions.
[2023-10-26 08:37:22,687 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:22,687 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1554 transitions.
[2023-10-26 08:37:22,706 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 74.0) internal successors, (1554), 21 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:22,710 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:22,711 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:22,711 INFO  L175             Difference]: Start difference. First operand has 107 places, 265 transitions, 1941 flow. Second operand 21 states and 1554 transitions.
[2023-10-26 08:37:22,711 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 558 transitions, 4800 flow
[2023-10-26 08:37:22,756 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 558 transitions, 4770 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-10-26 08:37:22,785 INFO  L231             Difference]: Finished difference. Result has 131 places, 395 transitions, 3786 flow
[2023-10-26 08:37:22,786 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3786, PETRI_PLACES=131, PETRI_TRANSITIONS=395}
[2023-10-26 08:37:22,788 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places.
[2023-10-26 08:37:22,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 395 transitions, 3786 flow
[2023-10-26 08:37:22,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 59.869565217391305) internal successors, (1377), 23 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:22,790 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:22,790 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:22,796 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-26 08:37:22,993 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:22,994 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:37:22,994 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:22,995 INFO  L85        PathProgramCache]: Analyzing trace with hash -2068764240, now seen corresponding path program 1 times
[2023-10-26 08:37:22,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:22,995 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254600795]
[2023-10-26 08:37:22,995 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:22,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:23,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:23,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:23,123 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:23,123 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254600795]
[2023-10-26 08:37:23,123 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254600795] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:37:23,123 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073415021]
[2023-10-26 08:37:23,123 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:23,123 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:23,124 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:23,136 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:37:23,189 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-26 08:37:23,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:23,300 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-26 08:37:23,302 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:37:23,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:23,349 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:37:23,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:23,392 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073415021] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:37:23,392 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:37:23,392 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-26 08:37:23,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864521501]
[2023-10-26 08:37:23,393 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:37:23,394 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-26 08:37:23,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:23,394 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-26 08:37:23,394 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-26 08:37:23,529 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197
[2023-10-26 08:37:23,534 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 395 transitions, 3786 flow. Second operand  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:23,534 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:23,534 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197
[2023-10-26 08:37:23,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:23,781 INFO  L130       PetriNetUnfolder]: 322/901 cut-off events.
[2023-10-26 08:37:23,793 INFO  L131       PetriNetUnfolder]: For 3755/3789 co-relation queries the response was YES.
[2023-10-26 08:37:23,796 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4681 conditions, 901 events. 322/901 cut-off events. For 3755/3789 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5583 event pairs, 11 based on Foata normal form. 16/905 useless extension candidates. Maximal degree in co-relation 4536. Up to 295 conditions per place. 
[2023-10-26 08:37:23,799 INFO  L137   encePairwiseOnDemand]: 191/197 looper letters, 31 selfloop transitions, 12 changer transitions 3/294 dead transitions.
[2023-10-26 08:37:23,813 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 294 transitions, 2894 flow
[2023-10-26 08:37:23,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-26 08:37:23,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-26 08:37:23,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions.
[2023-10-26 08:37:23,815 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5583756345177665
[2023-10-26 08:37:23,815 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 770 transitions.
[2023-10-26 08:37:23,815 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions.
[2023-10-26 08:37:23,816 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:23,816 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions.
[2023-10-26 08:37:23,817 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:23,819 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:23,819 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:23,819 INFO  L175             Difference]: Start difference. First operand has 131 places, 395 transitions, 3786 flow. Second operand 7 states and 770 transitions.
[2023-10-26 08:37:23,819 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 294 transitions, 2894 flow
[2023-10-26 08:37:23,863 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 294 transitions, 2722 flow, removed 63 selfloop flow, removed 8 redundant places.
[2023-10-26 08:37:23,866 INFO  L231             Difference]: Finished difference. Result has 117 places, 286 transitions, 2600 flow
[2023-10-26 08:37:23,867 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2600, PETRI_PLACES=117, PETRI_TRANSITIONS=286}
[2023-10-26 08:37:23,868 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 58 predicate places.
[2023-10-26 08:37:23,868 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 286 transitions, 2600 flow
[2023-10-26 08:37:23,868 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:23,868 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:23,868 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:23,888 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-10-26 08:37:24,072 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:24,072 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:37:24,072 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:24,073 INFO  L85        PathProgramCache]: Analyzing trace with hash 2139930529, now seen corresponding path program 1 times
[2023-10-26 08:37:24,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:24,073 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941246028]
[2023-10-26 08:37:24,073 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:24,073 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:24,114 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:24,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:24,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:24,637 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941246028]
[2023-10-26 08:37:24,637 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941246028] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:37:24,637 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978795136]
[2023-10-26 08:37:24,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:24,638 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:24,638 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:24,639 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:37:24,698 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-26 08:37:24,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:24,806 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-26 08:37:24,808 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:37:24,839 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-26 08:37:24,906 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:37:24,958 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:37:25,006 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:25,007 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:37:25,063 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:25,064 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:37:25,137 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:25,139 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:37:25,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:25,147 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:37:25,183 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) is different from false
[2023-10-26 08:37:25,197 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:37:25,209 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:37:25,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:25,344 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [978795136] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:37:25,344 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:37:25,344 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-26 08:37:25,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063966433]
[2023-10-26 08:37:25,345 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:37:25,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 08:37:25,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:25,346 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 08:37:25,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-26 08:37:25,396 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 197
[2023-10-26 08:37:25,400 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 286 transitions, 2600 flow. Second operand  has 26 states, 26 states have (on average 56.65384615384615) internal successors, (1473), 26 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:25,400 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:25,400 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 197
[2023-10-26 08:37:25,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:28,216 INFO  L130       PetriNetUnfolder]: 532/1249 cut-off events.
[2023-10-26 08:37:28,216 INFO  L131       PetriNetUnfolder]: For 5011/5011 co-relation queries the response was YES.
[2023-10-26 08:37:28,220 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6797 conditions, 1249 events. 532/1249 cut-off events. For 5011/5011 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7590 event pairs, 30 based on Foata normal form. 43/1292 useless extension candidates. Maximal degree in co-relation 6640. Up to 666 conditions per place. 
[2023-10-26 08:37:28,231 INFO  L137   encePairwiseOnDemand]: 160/197 looper letters, 276 selfloop transitions, 203 changer transitions 6/487 dead transitions.
[2023-10-26 08:37:28,231 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 487 transitions, 5040 flow
[2023-10-26 08:37:28,232 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-10-26 08:37:28,232 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-10-26 08:37:28,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1342 transitions.
[2023-10-26 08:37:28,255 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34060913705583756
[2023-10-26 08:37:28,255 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1342 transitions.
[2023-10-26 08:37:28,255 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1342 transitions.
[2023-10-26 08:37:28,257 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:28,257 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1342 transitions.
[2023-10-26 08:37:28,260 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 67.1) internal successors, (1342), 20 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:28,265 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:28,265 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:28,266 INFO  L175             Difference]: Start difference. First operand has 117 places, 286 transitions, 2600 flow. Second operand 20 states and 1342 transitions.
[2023-10-26 08:37:28,266 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 487 transitions, 5040 flow
[2023-10-26 08:37:28,321 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 487 transitions, 5016 flow, removed 6 selfloop flow, removed 4 redundant places.
[2023-10-26 08:37:28,328 INFO  L231             Difference]: Finished difference. Result has 137 places, 364 transitions, 4084 flow
[2023-10-26 08:37:28,330 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=2586, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4084, PETRI_PLACES=137, PETRI_TRANSITIONS=364}
[2023-10-26 08:37:28,331 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 78 predicate places.
[2023-10-26 08:37:28,331 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 364 transitions, 4084 flow
[2023-10-26 08:37:28,345 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.65384615384615) internal successors, (1473), 26 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:28,346 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:28,346 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:28,352 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-26 08:37:28,550 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:28,550 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:37:28,551 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:28,551 INFO  L85        PathProgramCache]: Analyzing trace with hash -920454980, now seen corresponding path program 1 times
[2023-10-26 08:37:28,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:28,551 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676356886]
[2023-10-26 08:37:28,551 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:28,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:28,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:29,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:29,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:29,090 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676356886]
[2023-10-26 08:37:29,090 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676356886] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:37:29,090 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681849223]
[2023-10-26 08:37:29,091 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:29,091 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:29,091 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:29,106 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:37:29,157 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-10-26 08:37:29,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:29,262 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-26 08:37:29,264 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:37:29,303 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-26 08:37:29,415 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:37:29,440 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:29,440 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:37:29,483 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:29,484 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:29,487 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:37:29,547 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:29,554 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:29,555 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:29,556 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:37:29,663 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:29,664 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:37:29,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:29,710 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:37:29,749 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false
[2023-10-26 08:37:29,792 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39)))) is different from false
[2023-10-26 08:37:30,264 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39)))))) is different from false
[2023-10-26 08:37:30,530 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:30,531 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2023-10-26 08:37:30,536 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:30,537 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-10-26 08:37:30,541 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-10-26 08:37:30,634 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:30,634 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [681849223] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:37:30,634 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:37:30,634 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-10-26 08:37:30,634 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411800114]
[2023-10-26 08:37:30,635 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:37:30,635 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-10-26 08:37:30,635 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:30,635 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-10-26 08:37:30,635 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=520, Unknown=17, NotChecked=150, Total=812
[2023-10-26 08:37:30,762 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 197
[2023-10-26 08:37:30,763 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 364 transitions, 4084 flow. Second operand  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:30,763 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:30,763 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 197
[2023-10-26 08:37:30,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:31,744 INFO  L130       PetriNetUnfolder]: 506/1193 cut-off events.
[2023-10-26 08:37:31,745 INFO  L131       PetriNetUnfolder]: For 8524/8531 co-relation queries the response was YES.
[2023-10-26 08:37:31,748 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7861 conditions, 1193 events. 506/1193 cut-off events. For 8524/8531 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7068 event pairs, 48 based on Foata normal form. 29/1221 useless extension candidates. Maximal degree in co-relation 7689. Up to 1103 conditions per place. 
[2023-10-26 08:37:31,767 INFO  L137   encePairwiseOnDemand]: 188/197 looper letters, 365 selfloop transitions, 13 changer transitions 1/381 dead transitions.
[2023-10-26 08:37:31,767 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 381 transitions, 4949 flow
[2023-10-26 08:37:31,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-10-26 08:37:31,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-10-26 08:37:31,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 643 transitions.
[2023-10-26 08:37:31,770 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.32639593908629444
[2023-10-26 08:37:31,770 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 643 transitions.
[2023-10-26 08:37:31,770 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 643 transitions.
[2023-10-26 08:37:31,771 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:31,771 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 643 transitions.
[2023-10-26 08:37:31,782 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 64.3) internal successors, (643), 10 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:31,784 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:31,784 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:31,784 INFO  L175             Difference]: Start difference. First operand has 137 places, 364 transitions, 4084 flow. Second operand 10 states and 643 transitions.
[2023-10-26 08:37:31,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 381 transitions, 4949 flow
[2023-10-26 08:37:31,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 381 transitions, 4786 flow, removed 42 selfloop flow, removed 12 redundant places.
[2023-10-26 08:37:31,864 INFO  L231             Difference]: Finished difference. Result has 133 places, 349 transitions, 3800 flow
[2023-10-26 08:37:31,878 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3800, PETRI_PLACES=133, PETRI_TRANSITIONS=349}
[2023-10-26 08:37:31,879 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 74 predicate places.
[2023-10-26 08:37:31,879 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 349 transitions, 3800 flow
[2023-10-26 08:37:31,879 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:31,879 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:31,880 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:31,886 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-10-26 08:37:32,084 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:32,084 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:37:32,085 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:32,085 INFO  L85        PathProgramCache]: Analyzing trace with hash 819311960, now seen corresponding path program 2 times
[2023-10-26 08:37:32,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:32,085 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787799611]
[2023-10-26 08:37:32,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:32,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:32,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:32,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:32,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:32,918 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787799611]
[2023-10-26 08:37:32,918 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787799611] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:37:32,918 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381879051]
[2023-10-26 08:37:32,918 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:37:32,918 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:32,918 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:32,934 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:37:32,971 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-10-26 08:37:33,129 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:37:33,129 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:37:33,131 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjunts are in the unsatisfiable core
[2023-10-26 08:37:33,134 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:37:33,175 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2023-10-26 08:37:33,183 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-26 08:37:33,386 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:37:33,447 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:33,447 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:37:33,513 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:33,514 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:33,515 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:37:33,572 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:33,574 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2023-10-26 08:37:33,590 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:33,591 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:33,591 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:33,592 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:37:33,650 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:33,651 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:37:33,688 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:33,689 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:37:33,705 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:33,705 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:37:33,791 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:33,792 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:37:33,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:33,821 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:37:33,840 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_813 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:37:33,906 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:37:33,960 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:37:33,990 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse0 c_threadThread1of1ForFork0_~p~0.base (store (select .cse0 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false
[2023-10-26 08:37:34,027 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse0 c_threadThread1of1ForFork0_~p~0.base (store (select .cse0 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:37:34,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked.
[2023-10-26 08:37:34,158 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381879051] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:37:34,159 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:37:34,159 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 26
[2023-10-26 08:37:34,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544210708]
[2023-10-26 08:37:34,160 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:37:34,161 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-10-26 08:37:34,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:34,162 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-10-26 08:37:34,162 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=417, Unknown=5, NotChecked=230, Total=756
[2023-10-26 08:37:34,164 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 197
[2023-10-26 08:37:34,165 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 349 transitions, 3800 flow. Second operand  has 28 states, 28 states have (on average 51.964285714285715) internal successors, (1455), 28 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:34,165 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:34,165 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 197
[2023-10-26 08:37:34,165 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:36,176 INFO  L130       PetriNetUnfolder]: 499/1175 cut-off events.
[2023-10-26 08:37:36,176 INFO  L131       PetriNetUnfolder]: For 7545/7552 co-relation queries the response was YES.
[2023-10-26 08:37:36,179 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7604 conditions, 1175 events. 499/1175 cut-off events. For 7545/7552 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6971 event pairs, 21 based on Foata normal form. 22/1196 useless extension candidates. Maximal degree in co-relation 7438. Up to 399 conditions per place. 
[2023-10-26 08:37:36,192 INFO  L137   encePairwiseOnDemand]: 162/197 looper letters, 280 selfloop transitions, 219 changer transitions 6/507 dead transitions.
[2023-10-26 08:37:36,193 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 507 transitions, 6268 flow
[2023-10-26 08:37:36,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-26 08:37:36,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-26 08:37:36,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1166 transitions.
[2023-10-26 08:37:36,214 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3115148276783329
[2023-10-26 08:37:36,214 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1166 transitions.
[2023-10-26 08:37:36,215 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1166 transitions.
[2023-10-26 08:37:36,216 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:36,216 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1166 transitions.
[2023-10-26 08:37:36,221 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 61.36842105263158) internal successors, (1166), 19 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:36,246 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:36,247 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:36,247 INFO  L175             Difference]: Start difference. First operand has 133 places, 349 transitions, 3800 flow. Second operand 19 states and 1166 transitions.
[2023-10-26 08:37:36,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 507 transitions, 6268 flow
[2023-10-26 08:37:36,285 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 507 transitions, 6250 flow, removed 0 selfloop flow, removed 7 redundant places.
[2023-10-26 08:37:36,310 INFO  L231             Difference]: Finished difference. Result has 147 places, 364 transitions, 4621 flow
[2023-10-26 08:37:36,311 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3782, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4621, PETRI_PLACES=147, PETRI_TRANSITIONS=364}
[2023-10-26 08:37:36,311 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 88 predicate places.
[2023-10-26 08:37:36,311 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 364 transitions, 4621 flow
[2023-10-26 08:37:36,312 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 51.964285714285715) internal successors, (1455), 28 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:36,312 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:36,312 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-26 08:37:36,320 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-10-26 08:37:36,516 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2023-10-26 08:37:36,516 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:37:36,517 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:36,517 INFO  L85        PathProgramCache]: Analyzing trace with hash -1870719176, now seen corresponding path program 1 times
[2023-10-26 08:37:36,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:36,517 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287576441]
[2023-10-26 08:37:36,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:36,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:36,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:37:36,602 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:37:36,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:37:36,678 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:37:36,687 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:37:36,688 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-10-26 08:37:36,704 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-10-26 08:37:36,705 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-10-26 08:37:36,705 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-10-26 08:37:36,705 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-10-26 08:37:36,705 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-10-26 08:37:36,705 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-10-26 08:37:36,714 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-10-26 08:37:36,714 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-10-26 08:37:36,714 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-26 08:37:36,715 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:36,716 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:37:36,717 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-26 08:37:36,730 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-26 08:37:36,753 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-10-26 08:37:36,771 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-10-26 08:37:36,785 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:37:36,786 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 736 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-10-26 08:37:36,786 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2023-10-26 08:37:36,789 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2023-10-26 08:37:36,789 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:37:36,790 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2023-10-26 08:37:36,790 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2023-10-26 08:37:36,790 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-10-26 08:37:36,822 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-10-26 08:37:36,832 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:37:36,832 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 736 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-10-26 08:37:36,835 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2023-10-26 08:37:39,446 INFO  L134        LiptonReduction]: Checked pairs total: 23932
[2023-10-26 08:37:39,446 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-10-26 08:37:39,447 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:37:39,447 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24a68b05, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:37:39,448 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-10-26 08:37:39,459 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-10-26 08:37:39,459 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:37:39,459 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:39,459 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:39,460 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:37:39,460 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:39,460 INFO  L85        PathProgramCache]: Analyzing trace with hash 1725264381, now seen corresponding path program 1 times
[2023-10-26 08:37:39,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:39,460 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871636949]
[2023-10-26 08:37:39,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:39,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:39,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:39,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:39,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:39,675 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871636949]
[2023-10-26 08:37:39,675 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871636949] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:37:39,675 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:37:39,676 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:37:39,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078646830]
[2023-10-26 08:37:39,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:37:39,676 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:37:39,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:39,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:37:39,677 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:37:40,007 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2023-10-26 08:37:40,008 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 154 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:40,008 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:40,008 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2023-10-26 08:37:40,008 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:40,966 INFO  L130       PetriNetUnfolder]: 2858/5896 cut-off events.
[2023-10-26 08:37:40,980 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2023-10-26 08:37:40,984 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10786 conditions, 5896 events. 2858/5896 cut-off events. For 191/349 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 40990 event pairs, 819 based on Foata normal form. 0/5496 useless extension candidates. Maximal degree in co-relation 5173. Up to 3444 conditions per place. 
[2023-10-26 08:37:41,016 INFO  L137   encePairwiseOnDemand]: 197/217 looper letters, 69 selfloop transitions, 42 changer transitions 0/142 dead transitions.
[2023-10-26 08:37:41,016 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 532 flow
[2023-10-26 08:37:41,017 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:37:41,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:37:41,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions.
[2023-10-26 08:37:41,018 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5890937019969278
[2023-10-26 08:37:41,018 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 767 transitions.
[2023-10-26 08:37:41,018 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions.
[2023-10-26 08:37:41,018 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:41,018 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions.
[2023-10-26 08:37:41,019 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:41,021 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:41,030 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:41,031 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 767 transitions.
[2023-10-26 08:37:41,031 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 532 flow
[2023-10-26 08:37:41,032 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 142 transitions, 532 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:37:41,033 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2023-10-26 08:37:41,033 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=81, PETRI_TRANSITIONS=110}
[2023-10-26 08:37:41,034 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2023-10-26 08:37:41,034 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2023-10-26 08:37:41,034 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:41,034 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:41,034 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:41,035 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-26 08:37:41,035 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:37:41,035 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:41,035 INFO  L85        PathProgramCache]: Analyzing trace with hash -329715416, now seen corresponding path program 1 times
[2023-10-26 08:37:41,035 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:41,035 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397721569]
[2023-10-26 08:37:41,035 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:41,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:41,061 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:41,102 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:41,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:41,102 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397721569]
[2023-10-26 08:37:41,102 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397721569] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:37:41,102 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:37:41,102 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:37:41,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801568863]
[2023-10-26 08:37:41,103 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:37:41,104 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-26 08:37:41,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:41,104 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-26 08:37:41,104 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-26 08:37:41,162 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 217
[2023-10-26 08:37:41,163 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 110 transitions, 446 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:41,163 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:41,163 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 217
[2023-10-26 08:37:41,163 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:41,940 INFO  L130       PetriNetUnfolder]: 1510/4077 cut-off events.
[2023-10-26 08:37:41,940 INFO  L131       PetriNetUnfolder]: For 1360/1548 co-relation queries the response was YES.
[2023-10-26 08:37:41,946 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8852 conditions, 4077 events. 1510/4077 cut-off events. For 1360/1548 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 31624 event pairs, 527 based on Foata normal form. 0/3748 useless extension candidates. Maximal degree in co-relation 3838. Up to 1446 conditions per place. 
[2023-10-26 08:37:41,954 INFO  L137   encePairwiseOnDemand]: 213/217 looper letters, 37 selfloop transitions, 3 changer transitions 2/121 dead transitions.
[2023-10-26 08:37:41,969 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 562 flow
[2023-10-26 08:37:41,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 08:37:41,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 08:37:41,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions.
[2023-10-26 08:37:41,970 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.618663594470046
[2023-10-26 08:37:41,970 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 537 transitions.
[2023-10-26 08:37:41,971 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions.
[2023-10-26 08:37:41,971 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:41,971 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions.
[2023-10-26 08:37:41,972 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:41,972 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:41,973 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:41,973 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 537 transitions.
[2023-10-26 08:37:41,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 562 flow
[2023-10-26 08:37:41,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 121 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:37:41,978 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2023-10-26 08:37:41,978 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=86, PETRI_TRANSITIONS=112}
[2023-10-26 08:37:41,978 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2023-10-26 08:37:41,978 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2023-10-26 08:37:41,979 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:41,979 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:41,979 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:41,979 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-26 08:37:41,979 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:37:41,979 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:41,980 INFO  L85        PathProgramCache]: Analyzing trace with hash 580316733, now seen corresponding path program 1 times
[2023-10-26 08:37:41,980 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:41,980 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466864672]
[2023-10-26 08:37:41,980 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:41,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:41,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:42,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:42,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:42,164 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466864672]
[2023-10-26 08:37:42,164 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466864672] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:37:42,164 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:37:42,164 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:37:42,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173069886]
[2023-10-26 08:37:42,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:37:42,167 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:37:42,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:42,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:37:42,168 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:37:42,524 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 217
[2023-10-26 08:37:42,524 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 466 flow. Second operand  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:42,524 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:42,524 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 217
[2023-10-26 08:37:42,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:44,402 INFO  L130       PetriNetUnfolder]: 6215/11785 cut-off events.
[2023-10-26 08:37:44,402 INFO  L131       PetriNetUnfolder]: For 6036/6204 co-relation queries the response was YES.
[2023-10-26 08:37:44,435 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30089 conditions, 11785 events. 6215/11785 cut-off events. For 6036/6204 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 86479 event pairs, 1278 based on Foata normal form. 19/11441 useless extension candidates. Maximal degree in co-relation 29960. Up to 6839 conditions per place. 
[2023-10-26 08:37:44,525 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 116 selfloop transitions, 104 changer transitions 1/253 dead transitions.
[2023-10-26 08:37:44,525 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 253 transitions, 1504 flow
[2023-10-26 08:37:44,526 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:37:44,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:37:44,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 749 transitions.
[2023-10-26 08:37:44,527 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5752688172043011
[2023-10-26 08:37:44,527 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 749 transitions.
[2023-10-26 08:37:44,527 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 749 transitions.
[2023-10-26 08:37:44,527 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:44,527 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 749 transitions.
[2023-10-26 08:37:44,528 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:44,538 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:44,539 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:44,543 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 749 transitions.
[2023-10-26 08:37:44,544 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 253 transitions, 1504 flow
[2023-10-26 08:37:44,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 253 transitions, 1501 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:37:44,569 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2023-10-26 08:37:44,569 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=95, PETRI_TRANSITIONS=215}
[2023-10-26 08:37:44,570 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2023-10-26 08:37:44,570 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2023-10-26 08:37:44,570 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:44,571 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:44,571 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:44,571 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-26 08:37:44,571 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:37:44,571 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:44,571 INFO  L85        PathProgramCache]: Analyzing trace with hash 747515608, now seen corresponding path program 1 times
[2023-10-26 08:37:44,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:44,572 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500340112]
[2023-10-26 08:37:44,572 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:44,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:44,600 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:44,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:44,873 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:44,873 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500340112]
[2023-10-26 08:37:44,873 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500340112] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:37:44,873 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:37:44,873 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:37:44,873 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811729908]
[2023-10-26 08:37:44,873 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:37:44,874 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:37:44,874 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:44,874 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:37:44,874 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:37:45,041 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217
[2023-10-26 08:37:45,042 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 215 transitions, 1492 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:45,042 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:45,042 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217
[2023-10-26 08:37:45,042 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:47,646 INFO  L130       PetriNetUnfolder]: 10728/18665 cut-off events.
[2023-10-26 08:37:47,646 INFO  L131       PetriNetUnfolder]: For 23070/23295 co-relation queries the response was YES.
[2023-10-26 08:37:47,671 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63188 conditions, 18665 events. 10728/18665 cut-off events. For 23070/23295 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 132578 event pairs, 3389 based on Foata normal form. 4/17840 useless extension candidates. Maximal degree in co-relation 44831. Up to 15062 conditions per place. 
[2023-10-26 08:37:47,819 INFO  L137   encePairwiseOnDemand]: 183/217 looper letters, 241 selfloop transitions, 178 changer transitions 0/437 dead transitions.
[2023-10-26 08:37:47,820 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 437 transitions, 3398 flow
[2023-10-26 08:37:47,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:37:47,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:37:47,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions.
[2023-10-26 08:37:47,822 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6105990783410138
[2023-10-26 08:37:47,837 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 795 transitions.
[2023-10-26 08:37:47,837 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 795 transitions.
[2023-10-26 08:37:47,840 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:47,840 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 795 transitions.
[2023-10-26 08:37:47,841 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:47,842 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:47,842 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:47,842 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 795 transitions.
[2023-10-26 08:37:47,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 437 transitions, 3398 flow
[2023-10-26 08:37:47,905 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 437 transitions, 3388 flow, removed 5 selfloop flow, removed 1 redundant places.
[2023-10-26 08:37:47,909 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2023-10-26 08:37:47,909 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2975, PETRI_PLACES=102, PETRI_TRANSITIONS=377}
[2023-10-26 08:37:47,910 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2023-10-26 08:37:47,910 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2023-10-26 08:37:47,911 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:47,911 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:47,911 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:47,911 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-26 08:37:47,911 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:37:47,911 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:47,912 INFO  L85        PathProgramCache]: Analyzing trace with hash 102692192, now seen corresponding path program 1 times
[2023-10-26 08:37:47,912 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:47,912 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613752223]
[2023-10-26 08:37:47,912 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:47,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:47,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:48,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:48,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:48,365 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613752223]
[2023-10-26 08:37:48,366 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613752223] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:37:48,366 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274037272]
[2023-10-26 08:37:48,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:48,366 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:48,366 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:48,368 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:37:48,397 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-10-26 08:37:48,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:48,524 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-26 08:37:48,530 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:37:48,543 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-26 08:37:48,645 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:37:48,670 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:37:48,715 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:48,716 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:37:48,758 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:37:48,758 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:37:48,808 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:48,809 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:37:48,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:48,828 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:37:48,847 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false
[2023-10-26 08:37:48,874 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2023-10-26 08:37:48,887 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-10-26 08:37:49,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:37:49,012 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [274037272] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:37:49,012 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:37:49,012 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-26 08:37:49,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869384929]
[2023-10-26 08:37:49,012 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:37:49,012 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 08:37:49,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:49,012 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 08:37:49,013 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-26 08:37:49,053 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 65 out of 217
[2023-10-26 08:37:49,054 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:49,054 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:49,054 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 217
[2023-10-26 08:37:49,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:37:54,540 INFO  L130       PetriNetUnfolder]: 16562/27029 cut-off events.
[2023-10-26 08:37:54,540 INFO  L131       PetriNetUnfolder]: For 50811/50817 co-relation queries the response was YES.
[2023-10-26 08:37:54,593 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109425 conditions, 27029 events. 16562/27029 cut-off events. For 50811/50817 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 187796 event pairs, 4731 based on Foata normal form. 6/24531 useless extension candidates. Maximal degree in co-relation 73100. Up to 19181 conditions per place. 
[2023-10-26 08:37:54,810 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 551 selfloop transitions, 371 changer transitions 1/926 dead transitions.
[2023-10-26 08:37:54,810 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 926 transitions, 8498 flow
[2023-10-26 08:37:54,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-10-26 08:37:54,810 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2023-10-26 08:37:54,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1563 transitions.
[2023-10-26 08:37:54,818 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4001536098310292
[2023-10-26 08:37:54,818 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1563 transitions.
[2023-10-26 08:37:54,818 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1563 transitions.
[2023-10-26 08:37:54,819 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:37:54,819 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1563 transitions.
[2023-10-26 08:37:54,820 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 86.83333333333333) internal successors, (1563), 18 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:54,823 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 217.0) internal successors, (4123), 19 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:54,835 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 217.0) internal successors, (4123), 19 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:54,835 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 18 states and 1563 transitions.
[2023-10-26 08:37:54,835 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 926 transitions, 8498 flow
[2023-10-26 08:37:55,398 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 926 transitions, 8378 flow, removed 60 selfloop flow, removed 0 redundant places.
[2023-10-26 08:37:55,411 INFO  L231             Difference]: Finished difference. Result has 133 places, 653 transitions, 6935 flow
[2023-10-26 08:37:55,412 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6935, PETRI_PLACES=133, PETRI_TRANSITIONS=653}
[2023-10-26 08:37:55,412 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 62 predicate places.
[2023-10-26 08:37:55,412 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 653 transitions, 6935 flow
[2023-10-26 08:37:55,413 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:55,413 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:37:55,413 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:37:55,419 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-26 08:37:55,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-10-26 08:37:55,618 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:37:55,619 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:37:55,619 INFO  L85        PathProgramCache]: Analyzing trace with hash -1170144666, now seen corresponding path program 1 times
[2023-10-26 08:37:55,619 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:37:55,619 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749223710]
[2023-10-26 08:37:55,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:55,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:37:55,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:56,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:56,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:37:56,102 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749223710]
[2023-10-26 08:37:56,102 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749223710] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:37:56,102 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199351240]
[2023-10-26 08:37:56,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:37:56,103 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:37:56,103 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:37:56,118 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:37:56,149 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-10-26 08:37:56,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:37:56,303 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-26 08:37:56,305 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:37:56,321 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-26 08:37:56,448 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:37:56,484 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:56,485 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:37:56,528 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:56,529 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:56,529 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:37:56,578 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:56,579 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:56,580 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:56,581 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:37:56,641 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:37:56,642 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:37:56,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:37:56,681 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:37:56,944 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0))))) is different from false
[2023-10-26 08:37:57,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:37:57,091 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199351240] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:37:57,091 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:37:57,091 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-10-26 08:37:57,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372077403]
[2023-10-26 08:37:57,091 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:37:57,092 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-26 08:37:57,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:37:57,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-26 08:37:57,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=520, Unknown=23, NotChecked=48, Total=702
[2023-10-26 08:37:57,224 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 217
[2023-10-26 08:37:57,225 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 653 transitions, 6935 flow. Second operand  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:37:57,226 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:37:57,226 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 217
[2023-10-26 08:37:57,226 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:38:04,186 INFO  L130       PetriNetUnfolder]: 19305/31847 cut-off events.
[2023-10-26 08:38:04,186 INFO  L131       PetriNetUnfolder]: For 113899/113899 co-relation queries the response was YES.
[2023-10-26 08:38:04,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 154854 conditions, 31847 events. 19305/31847 cut-off events. For 113899/113899 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 228008 event pairs, 2748 based on Foata normal form. 230/29258 useless extension candidates. Maximal degree in co-relation 134937. Up to 15974 conditions per place. 
[2023-10-26 08:38:04,379 INFO  L137   encePairwiseOnDemand]: 187/217 looper letters, 841 selfloop transitions, 489 changer transitions 0/1333 dead transitions.
[2023-10-26 08:38:04,379 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 1333 transitions, 15562 flow
[2023-10-26 08:38:04,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-10-26 08:38:04,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-10-26 08:38:04,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1382 transitions.
[2023-10-26 08:38:04,396 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3980414746543779
[2023-10-26 08:38:04,396 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1382 transitions.
[2023-10-26 08:38:04,396 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1382 transitions.
[2023-10-26 08:38:04,396 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:38:04,403 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1382 transitions.
[2023-10-26 08:38:04,405 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 86.375) internal successors, (1382), 16 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:04,408 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 217.0) internal successors, (3689), 17 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:04,422 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 217.0) internal successors, (3689), 17 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:04,422 INFO  L175             Difference]: Start difference. First operand has 133 places, 653 transitions, 6935 flow. Second operand 16 states and 1382 transitions.
[2023-10-26 08:38:04,422 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 1333 transitions, 15562 flow
[2023-10-26 08:38:06,551 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 1333 transitions, 15515 flow, removed 22 selfloop flow, removed 1 redundant places.
[2023-10-26 08:38:06,567 INFO  L231             Difference]: Finished difference. Result has 154 places, 931 transitions, 11989 flow
[2023-10-26 08:38:06,567 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=6889, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11989, PETRI_PLACES=154, PETRI_TRANSITIONS=931}
[2023-10-26 08:38:06,567 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 83 predicate places.
[2023-10-26 08:38:06,568 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 931 transitions, 11989 flow
[2023-10-26 08:38:06,568 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:06,568 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:38:06,568 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:38:06,574 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-10-26 08:38:06,773 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-10-26 08:38:06,773 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:38:06,774 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:38:06,774 INFO  L85        PathProgramCache]: Analyzing trace with hash 1669689062, now seen corresponding path program 1 times
[2023-10-26 08:38:06,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:38:06,775 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595148718]
[2023-10-26 08:38:06,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:38:06,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:38:06,823 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:38:07,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:38:07,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:38:07,356 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595148718]
[2023-10-26 08:38:07,356 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595148718] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:38:07,356 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70117851]
[2023-10-26 08:38:07,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:38:07,356 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:38:07,356 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:38:07,357 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:38:07,408 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-10-26 08:38:07,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:38:07,582 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-26 08:38:07,588 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:38:07,600 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-26 08:38:07,693 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:38:07,714 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:38:07,756 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:38:07,756 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:38:07,802 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:38:07,802 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:38:07,854 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:07,855 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:38:07,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:38:07,876 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:38:07,898 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:38:08,073 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-10-26 08:38:08,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:38:08,211 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [70117851] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:38:08,211 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:38:08,211 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-26 08:38:08,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49320240]
[2023-10-26 08:38:08,211 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:38:08,211 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-26 08:38:08,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:38:08,212 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-26 08:38:08,212 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=446, Unknown=12, NotChecked=90, Total=650
[2023-10-26 08:38:08,534 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 217
[2023-10-26 08:38:08,535 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 931 transitions, 11989 flow. Second operand  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:08,535 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:38:08,535 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 217
[2023-10-26 08:38:08,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:38:18,423 INFO  L130       PetriNetUnfolder]: 23371/38348 cut-off events.
[2023-10-26 08:38:18,423 INFO  L131       PetriNetUnfolder]: For 185516/185516 co-relation queries the response was YES.
[2023-10-26 08:38:18,540 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 210064 conditions, 38348 events. 23371/38348 cut-off events. For 185516/185516 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 282963 event pairs, 3764 based on Foata normal form. 0/35273 useless extension candidates. Maximal degree in co-relation 181911. Up to 26196 conditions per place. 
[2023-10-26 08:38:18,681 INFO  L137   encePairwiseOnDemand]: 153/217 looper letters, 975 selfloop transitions, 621 changer transitions 1/1600 dead transitions.
[2023-10-26 08:38:18,681 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1600 transitions, 20849 flow
[2023-10-26 08:38:18,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-26 08:38:18,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-26 08:38:18,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1627 transitions.
[2023-10-26 08:38:18,696 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3946155711860296
[2023-10-26 08:38:18,696 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1627 transitions.
[2023-10-26 08:38:18,697 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1627 transitions.
[2023-10-26 08:38:18,697 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:38:18,697 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1627 transitions.
[2023-10-26 08:38:18,699 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 85.63157894736842) internal successors, (1627), 19 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:18,702 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:18,702 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:18,702 INFO  L175             Difference]: Start difference. First operand has 154 places, 931 transitions, 11989 flow. Second operand 19 states and 1627 transitions.
[2023-10-26 08:38:18,702 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1600 transitions, 20849 flow
[2023-10-26 08:38:22,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1600 transitions, 20663 flow, removed 68 selfloop flow, removed 5 redundant places.
[2023-10-26 08:38:22,445 INFO  L231             Difference]: Finished difference. Result has 172 places, 1306 transitions, 18102 flow
[2023-10-26 08:38:22,446 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=11813, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=18102, PETRI_PLACES=172, PETRI_TRANSITIONS=1306}
[2023-10-26 08:38:22,451 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 101 predicate places.
[2023-10-26 08:38:22,451 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 1306 transitions, 18102 flow
[2023-10-26 08:38:22,451 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:22,451 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:38:22,451 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:38:22,458 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2023-10-26 08:38:22,656 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-26 08:38:22,657 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:38:22,657 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:38:22,657 INFO  L85        PathProgramCache]: Analyzing trace with hash 517033069, now seen corresponding path program 1 times
[2023-10-26 08:38:22,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:38:22,658 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29366479]
[2023-10-26 08:38:22,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:38:22,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:38:22,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:38:23,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:38:23,143 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:38:23,143 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29366479]
[2023-10-26 08:38:23,143 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29366479] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:38:23,143 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127645770]
[2023-10-26 08:38:23,143 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:38:23,143 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:38:23,143 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:38:23,144 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:38:23,187 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-10-26 08:38:23,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:38:23,347 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-26 08:38:23,349 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:38:23,378 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-26 08:38:23,466 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:38:23,489 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:23,490 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:38:23,520 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:23,521 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:23,522 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:38:23,554 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:23,555 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:23,556 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:23,558 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:38:23,643 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:38:23,648 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:38:23,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:38:23,675 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:38:23,692 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2023-10-26 08:38:23,719 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-10-26 08:38:23,768 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))))) is different from false
[2023-10-26 08:38:23,803 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2))) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39)))))) is different from false
[2023-10-26 08:38:23,861 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))))) is different from false
[2023-10-26 08:38:23,882 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:38:23,883 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-10-26 08:38:23,889 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:38:23,889 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2023-10-26 08:38:23,892 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2023-10-26 08:38:23,913 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:38:23,914 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-10-26 08:38:23,919 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:38:23,919 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-26 08:38:23,923 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:38:23,924 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-26 08:38:24,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:38:24,006 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127645770] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:38:24,006 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:38:24,006 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-10-26 08:38:24,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667808556]
[2023-10-26 08:38:24,006 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:38:24,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-10-26 08:38:24,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:38:24,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-10-26 08:38:24,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=455, Unknown=5, NotChecked=240, Total=812
[2023-10-26 08:38:24,166 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 217
[2023-10-26 08:38:24,167 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1306 transitions, 18102 flow. Second operand  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:24,167 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:38:24,167 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 217
[2023-10-26 08:38:24,167 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:38:37,377 INFO  L130       PetriNetUnfolder]: 27062/44967 cut-off events.
[2023-10-26 08:38:37,378 INFO  L131       PetriNetUnfolder]: For 320825/320835 co-relation queries the response was YES.
[2023-10-26 08:38:37,566 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 294720 conditions, 44967 events. 27062/44967 cut-off events. For 320825/320835 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 342153 event pairs, 3307 based on Foata normal form. 283/41530 useless extension candidates. Maximal degree in co-relation 256432. Up to 23187 conditions per place. 
[2023-10-26 08:38:37,825 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 1188 selfloop transitions, 910 changer transitions 0/2101 dead transitions.
[2023-10-26 08:38:37,825 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 2101 transitions, 32784 flow
[2023-10-26 08:38:37,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-10-26 08:38:37,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2023-10-26 08:38:37,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1157 transitions.
[2023-10-26 08:38:37,827 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.380842659644503
[2023-10-26 08:38:37,827 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1157 transitions.
[2023-10-26 08:38:37,827 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1157 transitions.
[2023-10-26 08:38:37,828 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:38:37,828 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1157 transitions.
[2023-10-26 08:38:37,829 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 82.64285714285714) internal successors, (1157), 14 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:37,831 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 217.0) internal successors, (3255), 15 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:37,832 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 217.0) internal successors, (3255), 15 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:37,832 INFO  L175             Difference]: Start difference. First operand has 172 places, 1306 transitions, 18102 flow. Second operand 14 states and 1157 transitions.
[2023-10-26 08:38:37,832 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 2101 transitions, 32784 flow
[2023-10-26 08:38:47,231 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 2101 transitions, 32421 flow, removed 138 selfloop flow, removed 9 redundant places.
[2023-10-26 08:38:47,254 INFO  L231             Difference]: Finished difference. Result has 183 places, 1750 transitions, 28975 flow
[2023-10-26 08:38:47,255 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=17885, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=466, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=28975, PETRI_PLACES=183, PETRI_TRANSITIONS=1750}
[2023-10-26 08:38:47,256 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 112 predicate places.
[2023-10-26 08:38:47,256 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 1750 transitions, 28975 flow
[2023-10-26 08:38:47,256 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:47,256 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:38:47,256 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:38:47,263 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2023-10-26 08:38:47,461 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:38:47,461 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:38:47,464 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:38:47,464 INFO  L85        PathProgramCache]: Analyzing trace with hash -785127108, now seen corresponding path program 1 times
[2023-10-26 08:38:47,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:38:47,465 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578113958]
[2023-10-26 08:38:47,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:38:47,466 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:38:47,502 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:38:47,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:38:47,775 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:38:47,775 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578113958]
[2023-10-26 08:38:47,775 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578113958] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:38:47,775 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:38:47,775 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:38:47,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958502792]
[2023-10-26 08:38:47,789 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:38:47,790 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:38:47,790 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:38:47,790 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:38:47,790 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:38:48,252 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 217
[2023-10-26 08:38:48,252 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 1750 transitions, 28975 flow. Second operand  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:48,252 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:38:48,252 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 217
[2023-10-26 08:38:48,252 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:38:59,101 INFO  L130       PetriNetUnfolder]: 21880/39367 cut-off events.
[2023-10-26 08:38:59,102 INFO  L131       PetriNetUnfolder]: For 410800/417515 co-relation queries the response was YES.
[2023-10-26 08:38:59,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 266213 conditions, 39367 events. 21880/39367 cut-off events. For 410800/417515 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 331804 event pairs, 4147 based on Foata normal form. 1101/39049 useless extension candidates. Maximal degree in co-relation 240356. Up to 24514 conditions per place. 
[2023-10-26 08:38:59,570 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 1438 selfloop transitions, 201 changer transitions 0/1965 dead transitions.
[2023-10-26 08:38:59,570 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1965 transitions, 35740 flow
[2023-10-26 08:38:59,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:38:59,571 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:38:59,571 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions.
[2023-10-26 08:38:59,571 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5898617511520737
[2023-10-26 08:38:59,572 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 768 transitions.
[2023-10-26 08:38:59,572 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions.
[2023-10-26 08:38:59,572 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:38:59,572 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions.
[2023-10-26 08:38:59,573 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:59,589 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:59,590 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:38:59,590 INFO  L175             Difference]: Start difference. First operand has 183 places, 1750 transitions, 28975 flow. Second operand 6 states and 768 transitions.
[2023-10-26 08:38:59,590 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1965 transitions, 35740 flow
[2023-10-26 08:39:05,538 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1965 transitions, 35658 flow, removed 0 selfloop flow, removed 6 redundant places.
[2023-10-26 08:39:05,582 INFO  L231             Difference]: Finished difference. Result has 187 places, 1938 transitions, 33051 flow
[2023-10-26 08:39:05,592 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=28893, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=33051, PETRI_PLACES=187, PETRI_TRANSITIONS=1938}
[2023-10-26 08:39:05,593 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 116 predicate places.
[2023-10-26 08:39:05,593 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 1938 transitions, 33051 flow
[2023-10-26 08:39:05,593 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:05,593 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:39:05,593 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:39:05,594 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-26 08:39:05,594 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:39:05,594 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:39:05,594 INFO  L85        PathProgramCache]: Analyzing trace with hash -672070267, now seen corresponding path program 2 times
[2023-10-26 08:39:05,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:39:05,594 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324021710]
[2023-10-26 08:39:05,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:39:05,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:39:05,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:39:06,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:39:06,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:39:06,218 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324021710]
[2023-10-26 08:39:06,219 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324021710] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:39:06,219 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157471283]
[2023-10-26 08:39:06,219 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:39:06,219 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:39:06,219 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:39:06,226 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:39:06,262 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-10-26 08:39:06,417 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:39:06,417 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:39:06,418 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-10-26 08:39:06,422 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:39:06,440 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2023-10-26 08:39:06,568 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:39:06,618 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:39:06,662 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:39:06,662 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:39:06,706 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:39:06,706 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:39:06,759 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:39:06,760 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:39:06,784 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:39:06,785 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:39:06,816 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:39:06,817 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:39:06,830 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:39:06,830 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:39:06,892 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:39:06,893 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:39:06,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:39:06,900 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:39:06,922 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-10-26 08:39:21,449 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:39:21,472 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:39:21,500 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:39:21,500 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54
[2023-10-26 08:39:21,528 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:39:21,528 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 66
[2023-10-26 08:39:21,532 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24
[2023-10-26 08:39:21,534 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34
[2023-10-26 08:39:21,558 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:39:21,558 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1
[2023-10-26 08:39:21,563 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:39:21,563 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2023-10-26 08:39:21,568 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:39:21,568 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2023-10-26 08:39:21,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 4 times theorem prover too weak. 0 trivial. 4 not checked.
[2023-10-26 08:39:21,648 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157471283] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:39:21,648 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:39:21,648 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25
[2023-10-26 08:39:21,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480747131]
[2023-10-26 08:39:21,649 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:39:21,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-26 08:39:21,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:39:21,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-26 08:39:21,650 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=422, Unknown=34, NotChecked=138, Total=702
[2023-10-26 08:39:21,816 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 217
[2023-10-26 08:39:21,817 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1938 transitions, 33051 flow. Second operand  has 27 states, 27 states have (on average 65.18518518518519) internal successors, (1760), 27 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:21,817 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:39:21,817 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 217
[2023-10-26 08:39:21,817 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:39:43,680 INFO  L130       PetriNetUnfolder]: 29687/49460 cut-off events.
[2023-10-26 08:39:43,681 INFO  L131       PetriNetUnfolder]: For 506468/506486 co-relation queries the response was YES.
[2023-10-26 08:39:43,955 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 362783 conditions, 49460 events. 29687/49460 cut-off events. For 506468/506486 co-relation queries the response was YES. Maximal size of possible extension queue 1367. Compared 383173 event pairs, 4267 based on Foata normal form. 12/46050 useless extension candidates. Maximal degree in co-relation 329754. Up to 26295 conditions per place. 
[2023-10-26 08:39:44,227 INFO  L137   encePairwiseOnDemand]: 153/217 looper letters, 1319 selfloop transitions, 1599 changer transitions 1/2923 dead transitions.
[2023-10-26 08:39:44,227 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 2923 transitions, 51033 flow
[2023-10-26 08:39:44,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-26 08:39:44,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-26 08:39:44,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1627 transitions.
[2023-10-26 08:39:44,230 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3946155711860296
[2023-10-26 08:39:44,230 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1627 transitions.
[2023-10-26 08:39:44,230 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1627 transitions.
[2023-10-26 08:39:44,245 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:39:44,246 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1627 transitions.
[2023-10-26 08:39:44,248 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 85.63157894736842) internal successors, (1627), 19 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:44,250 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:44,254 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:44,255 INFO  L175             Difference]: Start difference. First operand has 187 places, 1938 transitions, 33051 flow. Second operand 19 states and 1627 transitions.
[2023-10-26 08:39:44,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 2923 transitions, 51033 flow
[2023-10-26 08:39:56,999 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 2923 transitions, 50739 flow, removed 147 selfloop flow, removed 0 redundant places.
[2023-10-26 08:39:57,060 INFO  L231             Difference]: Finished difference. Result has 211 places, 2442 transitions, 46474 flow
[2023-10-26 08:39:57,070 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=32763, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=46474, PETRI_PLACES=211, PETRI_TRANSITIONS=2442}
[2023-10-26 08:39:57,070 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 140 predicate places.
[2023-10-26 08:39:57,070 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 2442 transitions, 46474 flow
[2023-10-26 08:39:57,071 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 65.18518518518519) internal successors, (1760), 27 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:57,071 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:39:57,071 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:39:57,077 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2023-10-26 08:39:57,275 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:39:57,276 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:39:57,277 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:39:57,277 INFO  L85        PathProgramCache]: Analyzing trace with hash -72607429, now seen corresponding path program 1 times
[2023-10-26 08:39:57,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:39:57,278 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168930355]
[2023-10-26 08:39:57,278 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:39:57,278 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:39:57,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:39:58,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:39:58,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:39:58,107 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168930355]
[2023-10-26 08:39:58,107 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168930355] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:39:58,107 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642663839]
[2023-10-26 08:39:58,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:39:58,107 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:39:58,107 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:39:58,117 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:39:58,142 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-10-26 08:39:58,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:39:58,313 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core
[2023-10-26 08:39:58,318 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:39:58,325 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:39:58,327 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:39:58,330 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2023-10-26 08:39:58,796 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-26 08:39:58,796 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2023-10-26 08:39:58,916 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-26 08:39:58,916 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2023-10-26 08:39:59,073 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-10-26 08:39:59,073 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40
[2023-10-26 08:39:59,092 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:39:59,099 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:39:59,126 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:39:59,126 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:39:59,139 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:39:59,139 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:39:59,151 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:39:59,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:39:59,171 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:39:59,190 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-10-26 08:39:59,210 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2023-10-26 08:39:59,245 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-10-26 08:39:59,260 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:39:59,272 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:39:59,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-10-26 08:39:59,280 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:39:59,280 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32
[2023-10-26 08:39:59,301 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:39:59,302 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-26 08:39:59,307 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:39:59,307 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-10-26 08:39:59,311 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:39:59,311 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-26 08:39:59,375 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1749) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-10-26 08:39:59,554 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_70| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_#t~mem11#1.base_70| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_70| v_ArrVal_1748) .cse0 v_ArrVal_1749) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) .cse0))))) is different from false
[2023-10-26 08:39:59,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:39:59,556 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642663839] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:39:59,556 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:39:59,556 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 27
[2023-10-26 08:39:59,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849578234]
[2023-10-26 08:39:59,557 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:39:59,558 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-10-26 08:39:59,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:39:59,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-10-26 08:39:59,558 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=428, Unknown=14, NotChecked=282, Total=812
[2023-10-26 08:39:59,963 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 217
[2023-10-26 08:39:59,964 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 2442 transitions, 46474 flow. Second operand  has 29 states, 29 states have (on average 61.51724137931034) internal successors, (1784), 29 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:39:59,964 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:39:59,964 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 217
[2023-10-26 08:39:59,964 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:40:33,802 INFO  L130       PetriNetUnfolder]: 40757/67233 cut-off events.
[2023-10-26 08:40:33,802 INFO  L131       PetriNetUnfolder]: For 938083/938083 co-relation queries the response was YES.
[2023-10-26 08:40:34,208 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 555629 conditions, 67233 events. 40757/67233 cut-off events. For 938083/938083 co-relation queries the response was YES. Maximal size of possible extension queue 1723. Compared 530156 event pairs, 5429 based on Foata normal form. 0/62933 useless extension candidates. Maximal degree in co-relation 503090. Up to 50081 conditions per place. 
[2023-10-26 08:40:34,547 INFO  L137   encePairwiseOnDemand]: 182/217 looper letters, 3828 selfloop transitions, 616 changer transitions 4/4449 dead transitions.
[2023-10-26 08:40:34,548 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 4449 transitions, 86743 flow
[2023-10-26 08:40:34,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-10-26 08:40:34,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-10-26 08:40:34,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1973 transitions.
[2023-10-26 08:40:34,552 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3496986884083658
[2023-10-26 08:40:34,552 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1973 transitions.
[2023-10-26 08:40:34,552 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1973 transitions.
[2023-10-26 08:40:34,552 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:40:34,553 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1973 transitions.
[2023-10-26 08:40:34,554 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 75.88461538461539) internal successors, (1973), 26 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:34,675 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 217.0) internal successors, (5859), 27 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:34,675 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 217.0) internal successors, (5859), 27 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:40:34,675 INFO  L175             Difference]: Start difference. First operand has 211 places, 2442 transitions, 46474 flow. Second operand 26 states and 1973 transitions.
[2023-10-26 08:40:34,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 4449 transitions, 86743 flow
[2023-10-26 08:41:15,937 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 4449 transitions, 85621 flow, removed 484 selfloop flow, removed 11 redundant places.
[2023-10-26 08:41:16,008 INFO  L231             Difference]: Finished difference. Result has 243 places, 3095 transitions, 60712 flow
[2023-10-26 08:41:16,010 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=45796, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2099, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=60712, PETRI_PLACES=243, PETRI_TRANSITIONS=3095}
[2023-10-26 08:41:16,010 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 172 predicate places.
[2023-10-26 08:41:16,011 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 3095 transitions, 60712 flow
[2023-10-26 08:41:16,011 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 61.51724137931034) internal successors, (1784), 29 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:41:16,011 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:16,011 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:16,018 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2023-10-26 08:41:16,216 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2023-10-26 08:41:16,217 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:41:16,220 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:16,220 INFO  L85        PathProgramCache]: Analyzing trace with hash -824079329, now seen corresponding path program 2 times
[2023-10-26 08:41:16,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:16,221 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868607294]
[2023-10-26 08:41:16,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:16,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:16,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:16,964 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:41:16,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:16,964 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868607294]
[2023-10-26 08:41:16,964 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868607294] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:41:16,964 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527545075]
[2023-10-26 08:41:16,964 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-26 08:41:16,964 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:41:16,964 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:41:16,965 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:41:16,992 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2023-10-26 08:41:17,181 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:41:17,181 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:41:17,183 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 62 conjunts are in the unsatisfiable core
[2023-10-26 08:41:17,186 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:41:17,213 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97
[2023-10-26 08:41:17,819 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-26 08:41:17,819 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59
[2023-10-26 08:41:17,835 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:41:17,838 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:41:17,849 INFO  L321             Elim1Store]: treesize reduction 15, result has 46.4 percent of original size
[2023-10-26 08:41:17,849 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 43
[2023-10-26 08:41:17,886 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:41:17,895 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2023-10-26 08:41:18,081 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-26 08:41:18,086 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-26 08:41:18,194 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:41:18,233 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:41:18,236 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:41:18,308 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:41:18,309 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:41:18,311 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:41:18,390 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:41:18,391 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:41:18,392 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:41:18,392 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:41:18,483 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:41:18,484 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:41:18,485 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:41:18,486 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-10-26 08:41:18,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:41:18,543 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:41:20,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:41:20,900 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527545075] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:41:20,900 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:41:20,900 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38
[2023-10-26 08:41:20,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894033044]
[2023-10-26 08:41:20,900 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:41:20,900 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2023-10-26 08:41:20,900 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:20,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2023-10-26 08:41:20,901 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1340, Unknown=19, NotChecked=0, Total=1560
[2023-10-26 08:41:22,962 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 217
[2023-10-26 08:41:22,964 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 3095 transitions, 60712 flow. Second operand  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:41:22,964 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:22,964 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 217
[2023-10-26 08:41:22,964 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:12,043 INFO  L130       PetriNetUnfolder]: 47364/78060 cut-off events.
[2023-10-26 08:42:12,044 INFO  L131       PetriNetUnfolder]: For 1552542/1552542 co-relation queries the response was YES.
[2023-10-26 08:42:12,700 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 706863 conditions, 78060 events. 47364/78060 cut-off events. For 1552542/1552542 co-relation queries the response was YES. Maximal size of possible extension queue 2106. Compared 635484 event pairs, 10277 based on Foata normal form. 262/75069 useless extension candidates. Maximal degree in co-relation 641199. Up to 65632 conditions per place. 
[2023-10-26 08:42:13,120 INFO  L137   encePairwiseOnDemand]: 188/217 looper letters, 3642 selfloop transitions, 522 changer transitions 8/4173 dead transitions.
[2023-10-26 08:42:13,121 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 4173 transitions, 88857 flow
[2023-10-26 08:42:13,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2023-10-26 08:42:13,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2023-10-26 08:42:13,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1504 transitions.
[2023-10-26 08:42:13,129 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2887864823348694
[2023-10-26 08:42:13,129 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1504 transitions.
[2023-10-26 08:42:13,130 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1504 transitions.
[2023-10-26 08:42:13,131 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:13,131 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1504 transitions.
[2023-10-26 08:42:13,136 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 62.666666666666664) internal successors, (1504), 24 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:42:13,140 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 217.0) internal successors, (5425), 25 states have internal predecessors, (5425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:42:13,141 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 217.0) internal successors, (5425), 25 states have internal predecessors, (5425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:42:13,141 INFO  L175             Difference]: Start difference. First operand has 243 places, 3095 transitions, 60712 flow. Second operand 24 states and 1504 transitions.
[2023-10-26 08:42:13,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 4173 transitions, 88857 flow
[2023-10-26 08:43:19,594 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 4173 transitions, 88127 flow, removed 361 selfloop flow, removed 4 redundant places.
[2023-10-26 08:43:19,653 INFO  L231             Difference]: Finished difference. Result has 276 places, 3663 transitions, 75088 flow
[2023-10-26 08:43:19,655 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=60008, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3095, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=75088, PETRI_PLACES=276, PETRI_TRANSITIONS=3663}
[2023-10-26 08:43:19,655 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 205 predicate places.
[2023-10-26 08:43:19,656 INFO  L495      AbstractCegarLoop]: Abstraction has has 276 places, 3663 transitions, 75088 flow
[2023-10-26 08:43:19,656 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:43:19,656 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:43:19,656 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:43:19,663 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2023-10-26 08:43:19,861 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2023-10-26 08:43:19,862 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:43:19,862 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:43:19,863 INFO  L85        PathProgramCache]: Analyzing trace with hash -83420593, now seen corresponding path program 3 times
[2023-10-26 08:43:19,863 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:43:19,863 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526534750]
[2023-10-26 08:43:19,864 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:43:19,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:43:19,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:43:20,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:43:20,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:43:20,900 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526534750]
[2023-10-26 08:43:20,900 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526534750] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:43:20,900 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711712760]
[2023-10-26 08:43:20,900 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-26 08:43:20,900 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:43:20,900 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:43:20,901 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:43:20,942 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2023-10-26 08:43:21,175 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-26 08:43:21,175 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:43:21,177 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 77 conjunts are in the unsatisfiable core
[2023-10-26 08:43:21,180 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:43:21,211 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:21,213 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:21,218 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2023-10-26 08:43:21,795 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-26 08:43:21,795 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 70
[2023-10-26 08:43:21,810 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:21,811 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:21,812 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:21,812 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35
[2023-10-26 08:43:21,995 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-26 08:43:21,995 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2023-10-26 08:43:22,002 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:22,003 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:22,004 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:22,005 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31
[2023-10-26 08:43:22,076 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:43:22,196 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:43:22,280 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:43:22,280 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:43:22,412 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-26 08:43:22,413 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 35
[2023-10-26 08:43:22,422 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2023-10-26 08:43:22,477 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:22,478 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:22,479 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:22,480 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:43:22,537 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:22,537 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:43:22,564 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:22,564 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:43:22,586 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:22,587 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:43:22,606 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:43:22,608 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:43:22,678 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:43:22,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:43:22,718 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:43:22,736 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2036 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:43:22,766 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:43:23,714 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2035) .cse1 v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2035) .cse1 v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2035) .cse1 v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2035) .cse1 v_ArrVal_2036) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-10-26 08:43:24,113 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:43:24,113 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2023-10-26 08:43:24,119 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:43:24,119 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 82
[2023-10-26 08:43:24,123 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50
[2023-10-26 08:43:24,141 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28
[2023-10-26 08:43:24,162 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:43:24,163 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2023-10-26 08:43:24,168 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:43:24,168 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-26 08:43:24,174 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:43:24,174 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-26 08:43:24,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:43:24,305 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711712760] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:43:24,305 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:43:24,305 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 33
[2023-10-26 08:43:24,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117385538]
[2023-10-26 08:43:24,305 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:43:24,305 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2023-10-26 08:43:24,305 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:43:24,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2023-10-26 08:43:24,306 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=819, Unknown=52, NotChecked=186, Total=1190
[2023-10-26 08:43:24,595 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2023-10-26 08:43:24,597 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 3663 transitions, 75088 flow. Second operand  has 35 states, 35 states have (on average 56.6) internal successors, (1981), 35 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:43:24,597 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:43:24,597 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2023-10-26 08:43:24,597 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:44:27,094 INFO  L130       PetriNetUnfolder]: 48002/79044 cut-off events.
[2023-10-26 08:44:27,095 INFO  L131       PetriNetUnfolder]: For 1725857/1725857 co-relation queries the response was YES.
[2023-10-26 08:44:27,850 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 735740 conditions, 79044 events. 48002/79044 cut-off events. For 1725857/1725857 co-relation queries the response was YES. Maximal size of possible extension queue 2148. Compared 640568 event pairs, 9649 based on Foata normal form. 71/75862 useless extension candidates. Maximal degree in co-relation 734183. Up to 70297 conditions per place. 
[2023-10-26 08:44:28,280 INFO  L137   encePairwiseOnDemand]: 165/217 looper letters, 4793 selfloop transitions, 946 changer transitions 150/5890 dead transitions.
[2023-10-26 08:44:28,280 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 5890 transitions, 120433 flow
[2023-10-26 08:44:28,281 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. 
[2023-10-26 08:44:28,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2023-10-26 08:44:28,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3695 transitions.
[2023-10-26 08:44:28,302 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.33387548567814224
[2023-10-26 08:44:28,303 INFO  L72            ComplementDD]: Start complementDD. Operand 51 states and 3695 transitions.
[2023-10-26 08:44:28,303 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 51 states and 3695 transitions.
[2023-10-26 08:44:28,303 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:44:28,303 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 3695 transitions.
[2023-10-26 08:44:28,307 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 52 states, 51 states have (on average 72.45098039215686) internal successors, (3695), 51 states have internal predecessors, (3695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:44:28,331 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 52 states, 52 states have (on average 217.0) internal successors, (11284), 52 states have internal predecessors, (11284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:44:28,332 INFO  L81            ComplementDD]: Finished complementDD. Result  has 52 states, 52 states have (on average 217.0) internal successors, (11284), 52 states have internal predecessors, (11284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:44:28,332 INFO  L175             Difference]: Start difference. First operand has 276 places, 3663 transitions, 75088 flow. Second operand 51 states and 3695 transitions.
[2023-10-26 08:44:28,332 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 5890 transitions, 120433 flow
[2023-10-26 08:45:47,277 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 5890 transitions, 118623 flow, removed 899 selfloop flow, removed 5 redundant places.
[2023-10-26 08:45:47,397 INFO  L231             Difference]: Finished difference. Result has 351 places, 4440 transitions, 92093 flow
[2023-10-26 08:45:47,402 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=73852, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=92093, PETRI_PLACES=351, PETRI_TRANSITIONS=4440}
[2023-10-26 08:45:47,403 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 280 predicate places.
[2023-10-26 08:45:47,404 INFO  L495      AbstractCegarLoop]: Abstraction has has 351 places, 4440 transitions, 92093 flow
[2023-10-26 08:45:47,404 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 56.6) internal successors, (1981), 35 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:45:47,404 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:45:47,404 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:45:47,415 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2023-10-26 08:45:47,610 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:45:47,610 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:45:47,611 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:45:47,611 INFO  L85        PathProgramCache]: Analyzing trace with hash 570602171, now seen corresponding path program 4 times
[2023-10-26 08:45:47,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:45:47,612 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927353392]
[2023-10-26 08:45:47,612 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:45:47,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:45:47,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:45:48,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:45:48,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:45:48,384 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927353392]
[2023-10-26 08:45:48,384 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927353392] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:45:48,384 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947689122]
[2023-10-26 08:45:48,384 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-26 08:45:48,384 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:45:48,384 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:45:48,385 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:45:48,411 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2023-10-26 08:45:48,698 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-26 08:45:48,698 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:45:48,700 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 55 conjunts are in the unsatisfiable core
[2023-10-26 08:45:48,703 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:45:48,716 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:48,718 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:48,721 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2023-10-26 08:45:48,794 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-26 08:45:49,162 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-26 08:45:49,162 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2023-10-26 08:45:49,348 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-26 08:45:49,348 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2023-10-26 08:45:49,438 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:45:49,505 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:49,506 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:45:49,643 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-10-26 08:45:49,643 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40
[2023-10-26 08:45:49,701 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:49,702 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:49,702 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:45:49,780 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:49,781 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:49,782 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:49,783 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:45:49,879 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:49,880 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:45:49,919 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:49,920 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:45:49,965 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:49,966 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:45:49,986 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:45:49,987 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:45:50,106 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:45:50,172 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:45:50,173 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:45:50,208 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2174 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:46:02,610 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2173) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2173) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2173) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2173) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:46:02,867 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2173) .cse1 v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2173) .cse1 v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2173) .cse1 v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_2174 (Array Int Int)) (v_ArrVal_2173 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2173) .cse1 v_ArrVal_2174) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-10-26 08:46:03,170 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:46:03,170 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2023-10-26 08:46:03,199 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:46:03,199 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 78
[2023-10-26 08:46:03,204 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32
[2023-10-26 08:46:03,206 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46
[2023-10-26 08:46:03,240 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:46:03,240 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-26 08:46:03,245 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:46:03,245 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2023-10-26 08:46:03,250 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:46:03,250 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-26 08:46:03,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-26 08:46:03,504 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [947689122] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:46:03,504 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:46:03,505 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35
[2023-10-26 08:46:03,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250774188]
[2023-10-26 08:46:03,505 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:46:03,505 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2023-10-26 08:46:03,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:46:03,505 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2023-10-26 08:46:03,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=934, Unknown=61, NotChecked=198, Total=1332
[2023-10-26 08:46:03,634 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2023-10-26 08:46:03,635 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 4440 transitions, 92093 flow. Second operand  has 37 states, 37 states have (on average 56.513513513513516) internal successors, (2091), 37 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:46:03,635 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:46:03,635 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2023-10-26 08:46:03,635 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:47:17,873 INFO  L130       PetriNetUnfolder]: 48760/80231 cut-off events.
[2023-10-26 08:47:17,873 INFO  L131       PetriNetUnfolder]: For 1958067/1958067 co-relation queries the response was YES.
[2023-10-26 08:47:18,890 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 779036 conditions, 80231 events. 48760/80231 cut-off events. For 1958067/1958067 co-relation queries the response was YES. Maximal size of possible extension queue 2169. Compared 651501 event pairs, 9360 based on Foata normal form. 48/77026 useless extension candidates. Maximal degree in co-relation 778453. Up to 71188 conditions per place. 
[2023-10-26 08:47:19,341 INFO  L137   encePairwiseOnDemand]: 166/217 looper letters, 5083 selfloop transitions, 896 changer transitions 88/6068 dead transitions.
[2023-10-26 08:47:19,342 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 6068 transitions, 129897 flow
[2023-10-26 08:47:19,342 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. 
[2023-10-26 08:47:19,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2023-10-26 08:47:19,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2794 transitions.
[2023-10-26 08:47:19,345 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3301429753042656
[2023-10-26 08:47:19,345 INFO  L72            ComplementDD]: Start complementDD. Operand 39 states and 2794 transitions.
[2023-10-26 08:47:19,345 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 39 states and 2794 transitions.
[2023-10-26 08:47:19,360 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:47:19,361 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2794 transitions.
[2023-10-26 08:47:19,363 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 40 states, 39 states have (on average 71.64102564102564) internal successors, (2794), 39 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:47:19,373 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 40 states, 40 states have (on average 217.0) internal successors, (8680), 40 states have internal predecessors, (8680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:47:19,374 INFO  L81            ComplementDD]: Finished complementDD. Result  has 40 states, 40 states have (on average 217.0) internal successors, (8680), 40 states have internal predecessors, (8680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:47:19,374 INFO  L175             Difference]: Start difference. First operand has 351 places, 4440 transitions, 92093 flow. Second operand 39 states and 2794 transitions.
[2023-10-26 08:47:19,375 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 6068 transitions, 129897 flow
[2023-10-26 08:49:19,066 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 6068 transitions, 127964 flow, removed 899 selfloop flow, removed 15 redundant places.
[2023-10-26 08:49:19,157 INFO  L231             Difference]: Finished difference. Result has 388 places, 4783 transitions, 100926 flow
[2023-10-26 08:49:19,160 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=90562, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=572, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=100926, PETRI_PLACES=388, PETRI_TRANSITIONS=4783}
[2023-10-26 08:49:19,161 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 317 predicate places.
[2023-10-26 08:49:19,161 INFO  L495      AbstractCegarLoop]: Abstraction has has 388 places, 4783 transitions, 100926 flow
[2023-10-26 08:49:19,162 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 56.513513513513516) internal successors, (2091), 37 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:49:19,162 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:49:19,162 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:49:19,170 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2023-10-26 08:49:19,368 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:49:19,371 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-26 08:49:19,372 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:49:19,373 INFO  L85        PathProgramCache]: Analyzing trace with hash 426726299, now seen corresponding path program 5 times
[2023-10-26 08:49:19,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:49:19,373 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147362054]
[2023-10-26 08:49:19,373 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:49:19,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:49:19,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:49:20,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:49:20,085 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:49:20,085 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147362054]
[2023-10-26 08:49:20,085 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147362054] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-26 08:49:20,085 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126521918]
[2023-10-26 08:49:20,085 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-26 08:49:20,086 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-26 08:49:20,086 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:49:20,090 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-26 08:49:20,122 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2023-10-26 08:49:20,341 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-26 08:49:20,341 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-26 08:49:20,343 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 66 conjunts are in the unsatisfiable core
[2023-10-26 08:49:20,346 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:49:20,354 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:20,356 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:20,361 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2023-10-26 08:49:20,361 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27
[2023-10-26 08:49:20,414 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-26 08:49:20,714 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-26 08:49:20,715 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 58
[2023-10-26 08:49:20,741 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18
[2023-10-26 08:49:20,926 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-26 08:49:20,927 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 68
[2023-10-26 08:49:21,046 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:49:21,158 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:49:21,159 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 46
[2023-10-26 08:49:21,236 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:21,237 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-26 08:49:21,292 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:21,293 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:21,297 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-26 08:49:21,354 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:21,355 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:21,356 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:21,357 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-26 08:49:21,519 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:21,520 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:49:21,543 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:21,544 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:49:21,563 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:21,564 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:49:21,610 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:49:21,610 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:49:21,682 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:49:21,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:49:21,721 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:49:21,739 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2314 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2314 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2314 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-10-26 08:49:21,767 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-26 08:49:22,278 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-10-26 08:49:22,298 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse4 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-26 08:49:22,311 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:49:22,311 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2023-10-26 08:49:22,317 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:49:22,317 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 82
[2023-10-26 08:49:22,321 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32
[2023-10-26 08:49:22,324 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46
[2023-10-26 08:49:22,342 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:49:22,343 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-26 08:49:22,347 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:49:22,348 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-26 08:49:22,353 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-26 08:49:22,353 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2023-10-26 08:49:22,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:49:22,563 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126521918] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:49:22,563 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-26 08:49:22,563 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35
[2023-10-26 08:49:22,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318499455]
[2023-10-26 08:49:22,563 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:49:22,564 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2023-10-26 08:49:22,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:49:22,564 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2023-10-26 08:49:22,564 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=886, Unknown=45, NotChecked=260, Total=1332
[2023-10-26 08:49:22,855 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2023-10-26 08:49:22,856 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 4783 transitions, 100926 flow. Second operand  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:49:22,856 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:49:22,856 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2023-10-26 08:49:22,856 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:50:46,027 INFO  L130       PetriNetUnfolder]: 49123/80770 cut-off events.
[2023-10-26 08:50:46,027 INFO  L131       PetriNetUnfolder]: For 2160728/2160728 co-relation queries the response was YES.
[2023-10-26 08:50:47,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 808132 conditions, 80770 events. 49123/80770 cut-off events. For 2160728/2160728 co-relation queries the response was YES. Maximal size of possible extension queue 2191. Compared 655895 event pairs, 9019 based on Foata normal form. 49/77566 useless extension candidates. Maximal degree in co-relation 806567. Up to 71131 conditions per place. 
[2023-10-26 08:50:47,721 INFO  L137   encePairwiseOnDemand]: 182/217 looper letters, 5242 selfloop transitions, 956 changer transitions 89/6288 dead transitions.
[2023-10-26 08:50:47,721 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 6288 transitions, 138240 flow
[2023-10-26 08:50:47,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2023-10-26 08:50:47,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2023-10-26 08:50:47,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2610 transitions.
[2023-10-26 08:50:47,726 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.32507161539419605
[2023-10-26 08:50:47,726 INFO  L72            ComplementDD]: Start complementDD. Operand 37 states and 2610 transitions.
[2023-10-26 08:50:47,726 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 2610 transitions.
[2023-10-26 08:50:47,727 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:50:47,728 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2610 transitions.
[2023-10-26 08:50:47,730 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 38 states, 37 states have (on average 70.54054054054055) internal successors, (2610), 37 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:50:47,735 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 38 states, 38 states have (on average 217.0) internal successors, (8246), 38 states have internal predecessors, (8246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:50:47,736 INFO  L81            ComplementDD]: Finished complementDD. Result  has 38 states, 38 states have (on average 217.0) internal successors, (8246), 38 states have internal predecessors, (8246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:50:47,736 INFO  L175             Difference]: Start difference. First operand has 388 places, 4783 transitions, 100926 flow. Second operand 37 states and 2610 transitions.
[2023-10-26 08:50:47,736 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 6288 transitions, 138240 flow
Killed by 15
