./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-index.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-index.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 bcd30fe6f63e74d5bf4775477d2912ebde33f792cbf35440e7d3010e3759da34
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 14:55:53,112 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 14:55:53,125 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 14:55:53,229 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 14:55:53,245 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 14:55:53,248 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 14:55:53,250 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 14:55:53,252 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 14:55:53,254 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 14:55:53,258 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 14:55:53,259 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 14:55:53,261 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 14:55:53,261 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 14:55:53,263 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 14:55:53,264 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 14:55:53,266 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 14:55:53,267 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 14:55:53,268 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 14:55:53,269 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 14:55:53,273 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 14:55:53,274 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 14:55:53,277 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 14:55:53,278 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 14:55:53,294 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 14:55:53,296 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 14:55:53,296 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 14:55:53,297 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 14:55:53,298 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 14:55:53,298 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 14:55:53,299 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 14:55:53,299 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 14:55:53,300 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 14:55:53,301 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 14:55:53,301 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 14:55:53,302 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 14:55:53,302 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 14:55:53,303 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 14:55:53,303 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 14:55:53,303 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 14:55:53,304 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 14:55:53,304 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 14:55:53,305 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 14:55:53,347 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 14:55:53,347 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 14:55:53,348 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 14:55:53,348 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 14:55:53,348 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 14:55:53,349 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 14:55:53,349 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 14:55:53,349 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 14:55:53,349 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 14:55:53,350 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 14:55:53,350 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 14:55:53,351 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 14:55:53,351 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 14:55:53,351 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 14:55:53,351 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 14:55:53,351 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 14:55:53,351 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 14:55:53,354 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 14:55:53,354 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 14:55:53,354 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 14:55:53,354 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 14:55:53,355 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 14:55:53,355 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 14:55:53,355 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 14:55:53,355 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 14:55:53,355 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 14:55:53,355 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 14:55:53,356 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 14:55:53,356 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 14:55:53,356 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 14:55:53,356 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 14:55:53,356 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 14:55:53,369 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 14:55:53,369 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 14:55:53,370 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 14:55:53,370 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 14:55:53,370 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 14:55:53,370 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 -> bcd30fe6f63e74d5bf4775477d2912ebde33f792cbf35440e7d3010e3759da34
[2023-10-25 14:55:54,597 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 14:55:54,912 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 14:55:54,919 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 14:55:54,920 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 14:55:54,921 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 14:55:54,922 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index.i
[2023-10-25 14:55:57,262 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 14:55:57,643 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 14:55:57,643 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index.i
[2023-10-25 14:55:57,671 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/58d97a145/dfe4b9d7c90447afb8a0c3ab89260f3d/FLAGa4b4f2b2c
[2023-10-25 14:55:57,700 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/58d97a145/dfe4b9d7c90447afb8a0c3ab89260f3d
[2023-10-25 14:55:57,703 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 14:55:57,704 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 14:55:57,705 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 14:55:57,705 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 14:55:57,708 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 14:55:57,708 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:55:57" (1/1) ...
[2023-10-25 14:55:57,710 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4072da13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:57, skipping insertion in model container
[2023-10-25 14:55:57,710 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:55:57" (1/1) ...
[2023-10-25 14:55:57,725 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 14:55:57,787 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 14:55:58,039 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 14:55:58,393 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 14:55:58,413 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 14:55:58,440 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 14:55:58,493 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 14:55:58,569 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 14:55:58,569 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58 WrapperNode
[2023-10-25 14:55:58,569 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 14:55:58,571 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 14:55:58,571 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 14:55:58,571 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 14:55:58,581 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,627 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,671 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2023-10-25 14:55:58,672 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 14:55:58,672 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 14:55:58,672 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 14:55:58,673 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 14:55:58,681 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,682 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,706 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,707 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,715 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,724 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,726 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,732 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,734 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 14:55:58,747 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 14:55:58,748 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 14:55:58,748 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 14:55:58,749 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (1/1) ...
[2023-10-25 14:55:58,753 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 14:55:58,774 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:55:58,807 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-25 14:55:58,853 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-25 14:55:58,864 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 14:55:58,864 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-25 14:55:58,864 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 14:55:58,865 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-25 14:55:58,865 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 14:55:58,865 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 14:55:58,865 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-25 14:55:58,865 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 14:55:58,865 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 14:55:58,865 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 14:55:58,865 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 14:55:58,867 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 14:55:59,310 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 14:55:59,311 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 14:55:59,786 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 14:55:59,797 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 14:55:59,798 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 14:55:59,800 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:55:59 BoogieIcfgContainer
[2023-10-25 14:55:59,809 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 14:55:59,811 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 14:55:59,811 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 14:55:59,814 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 14:55:59,814 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:55:57" (1/3) ...
[2023-10-25 14:55:59,814 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec663fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:55:59, skipping insertion in model container
[2023-10-25 14:55:59,815 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:55:58" (2/3) ...
[2023-10-25 14:55:59,816 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec663fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:55:59, skipping insertion in model container
[2023-10-25 14:55:59,816 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:55:59" (3/3) ...
[2023-10-25 14:55:59,817 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index.i
[2023-10-25 14:55:59,826 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 14:55:59,834 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 14:55:59,835 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-10-25 14:55:59,835 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 14:55:59,966 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-25 14:56:00,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,149 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2023-10-25 14:56:00,150 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 14:56:00,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 171 conditions, 165 events. 6/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-10-25 14:56:00,168 INFO  L82        GeneralOperation]: Start removeDead. Operand has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,174 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,178 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 14:56:00,204 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,210 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,211 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2023-10-25 14:56:00,289 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2023-10-25 14:56:00,289 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 14:56:00,290 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 171 conditions, 165 events. 6/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2023-10-25 14:56:00,291 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2052
[2023-10-25 14:56:03,755 INFO  L134        LiptonReduction]: Checked pairs total: 12265
[2023-10-25 14:56:03,755 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-10-25 14:56:03,773 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 14:56:03,796 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;@b8bcd7c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 14:56:03,796 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2023-10-25 14:56:03,798 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-25 14:56:03,798 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 14:56:03,798 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:03,799 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-25 14:56:03,800 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 14:56:03,804 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:03,805 INFO  L85        PathProgramCache]: Analyzing trace with hash 381, now seen corresponding path program 1 times
[2023-10-25 14:56:03,812 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:03,824 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779205028]
[2023-10-25 14:56:03,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:03,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:03,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:04,007 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-25 14:56:04,008 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:04,008 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779205028]
[2023-10-25 14:56:04,008 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779205028] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:04,009 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:04,009 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-25 14:56:04,010 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138482723]
[2023-10-25 14:56:04,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:04,016 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 14:56:04,024 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:04,059 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 14:56:04,060 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 14:56:04,075 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193
[2023-10-25 14:56:04,078 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 108 flow. Second operand  has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 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-25 14:56:04,078 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:04,078 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193
[2023-10-25 14:56:04,079 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:04,184 INFO  L130       PetriNetUnfolder]: 33/213 cut-off events.
[2023-10-25 14:56:04,184 INFO  L131       PetriNetUnfolder]: For 4/7 co-relation queries the response was YES.
[2023-10-25 14:56:04,186 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308 conditions, 213 events. 33/213 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1010 event pairs, 32 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 250. Up to 88 conditions per place. 
[2023-10-25 14:56:04,189 INFO  L137   encePairwiseOnDemand]: 192/193 looper letters, 16 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2023-10-25 14:56:04,201 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 138 flow
[2023-10-25 14:56:04,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 14:56:04,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 14:56:04,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions.
[2023-10-25 14:56:04,214 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6139896373056994
[2023-10-25 14:56:04,215 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 237 transitions.
[2023-10-25 14:56:04,215 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions.
[2023-10-25 14:56:04,226 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:04,228 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions.
[2023-10-25 14:56:04,233 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 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-25 14:56:04,243 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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-25 14:56:04,244 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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-25 14:56:04,246 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 237 transitions.
[2023-10-25 14:56:04,260 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 138 flow
[2023-10-25 14:56:04,262 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:04,264 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2023-10-25 14:56:04,265 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=49}
[2023-10-25 14:56:04,268 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2023-10-25 14:56:04,268 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2023-10-25 14:56:04,269 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 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-25 14:56:04,269 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:04,269 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:04,269 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 14:56:04,270 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 14:56:04,271 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:04,271 INFO  L85        PathProgramCache]: Analyzing trace with hash -835068003, now seen corresponding path program 1 times
[2023-10-25 14:56:04,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:04,273 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971683607]
[2023-10-25 14:56:04,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:04,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:04,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:04,949 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-25 14:56:04,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:04,962 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971683607]
[2023-10-25 14:56:04,962 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971683607] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:04,962 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:04,966 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:04,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647115630]
[2023-10-25 14:56:04,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:04,967 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:04,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:04,968 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:04,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:05,220 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2023-10-25 14:56:05,220 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 106 flow. Second operand  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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-25 14:56:05,221 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:05,221 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2023-10-25 14:56:05,221 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:05,492 INFO  L130       PetriNetUnfolder]: 245/703 cut-off events.
[2023-10-25 14:56:05,493 INFO  L131       PetriNetUnfolder]: For 7/9 co-relation queries the response was YES.
[2023-10-25 14:56:05,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 703 events. 245/703 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4008 event pairs, 86 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 1296. Up to 291 conditions per place. 
[2023-10-25 14:56:05,513 INFO  L137   encePairwiseOnDemand]: 170/193 looper letters, 61 selfloop transitions, 29 changer transitions 0/102 dead transitions.
[2023-10-25 14:56:05,513 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 395 flow
[2023-10-25 14:56:05,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:05,514 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:05,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 603 transitions.
[2023-10-25 14:56:05,518 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5207253886010362
[2023-10-25 14:56:05,518 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 603 transitions.
[2023-10-25 14:56:05,518 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 603 transitions.
[2023-10-25 14:56:05,519 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:05,519 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 603 transitions.
[2023-10-25 14:56:05,521 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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-25 14:56:05,524 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 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-25 14:56:05,525 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 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-25 14:56:05,525 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 603 transitions.
[2023-10-25 14:56:05,525 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 395 flow
[2023-10-25 14:56:05,527 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:05,529 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2023-10-25 14:56:05,529 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=62, PETRI_TRANSITIONS=78}
[2023-10-25 14:56:05,530 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2023-10-25 14:56:05,530 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2023-10-25 14:56:05,540 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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-25 14:56:05,540 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:05,540 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:05,540 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 14:56:05,541 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 14:56:05,542 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:05,542 INFO  L85        PathProgramCache]: Analyzing trace with hash 1573274442, now seen corresponding path program 1 times
[2023-10-25 14:56:05,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:05,542 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145144960]
[2023-10-25 14:56:05,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:05,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:05,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:05,600 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-25 14:56:05,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:05,600 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145144960]
[2023-10-25 14:56:05,600 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145144960] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:05,601 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:05,601 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 14:56:05,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587715158]
[2023-10-25 14:56:05,602 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:05,603 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 14:56:05,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:05,604 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 14:56:05,604 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 14:56:05,613 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 193
[2023-10-25 14:56:05,613 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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-25 14:56:05,613 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:05,613 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 193
[2023-10-25 14:56:05,614 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:05,735 INFO  L130       PetriNetUnfolder]: 122/485 cut-off events.
[2023-10-25 14:56:05,736 INFO  L131       PetriNetUnfolder]: For 111/116 co-relation queries the response was YES.
[2023-10-25 14:56:05,736 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 485 events. 122/485 cut-off events. For 111/116 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2711 event pairs, 10 based on Foata normal form. 11/468 useless extension candidates. Maximal degree in co-relation 1076. Up to 129 conditions per place. 
[2023-10-25 14:56:05,738 INFO  L137   encePairwiseOnDemand]: 189/193 looper letters, 24 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2023-10-25 14:56:05,738 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 392 flow
[2023-10-25 14:56:05,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 14:56:05,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 14:56:05,739 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions.
[2023-10-25 14:56:05,739 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5785837651122625
[2023-10-25 14:56:05,739 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 335 transitions.
[2023-10-25 14:56:05,739 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions.
[2023-10-25 14:56:05,740 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:05,740 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions.
[2023-10-25 14:56:05,741 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-25 14:56:05,742 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-25 14:56:05,742 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-25 14:56:05,742 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 335 transitions.
[2023-10-25 14:56:05,743 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 392 flow
[2023-10-25 14:56:05,763 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:05,765 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2023-10-25 14:56:05,765 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=78}
[2023-10-25 14:56:05,766 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2023-10-25 14:56:05,766 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2023-10-25 14:56:05,766 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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-25 14:56:05,767 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:05,767 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:05,767 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 14:56:05,770 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 14:56:05,770 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:05,770 INFO  L85        PathProgramCache]: Analyzing trace with hash 348753171, now seen corresponding path program 1 times
[2023-10-25 14:56:05,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:05,770 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957304986]
[2023-10-25 14:56:05,770 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:05,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:05,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:06,222 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-25 14:56:06,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:06,223 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957304986]
[2023-10-25 14:56:06,223 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957304986] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:06,223 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:06,223 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:06,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030850577]
[2023-10-25 14:56:06,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:06,224 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:06,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:06,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:06,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:06,472 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 193
[2023-10-25 14:56:06,473 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 336 flow. Second operand  has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 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-25 14:56:06,473 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:06,473 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 193
[2023-10-25 14:56:06,473 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:06,687 INFO  L130       PetriNetUnfolder]: 228/682 cut-off events.
[2023-10-25 14:56:06,688 INFO  L131       PetriNetUnfolder]: For 296/304 co-relation queries the response was YES.
[2023-10-25 14:56:06,691 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 682 events. 228/682 cut-off events. For 296/304 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3726 event pairs, 57 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 1748. Up to 360 conditions per place. 
[2023-10-25 14:56:06,693 INFO  L137   encePairwiseOnDemand]: 182/193 looper letters, 52 selfloop transitions, 33 changer transitions 8/128 dead transitions.
[2023-10-25 14:56:06,709 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 128 transitions, 725 flow
[2023-10-25 14:56:06,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:06,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:06,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions.
[2023-10-25 14:56:06,712 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5483592400690847
[2023-10-25 14:56:06,712 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 635 transitions.
[2023-10-25 14:56:06,712 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions.
[2023-10-25 14:56:06,713 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:06,713 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions.
[2023-10-25 14:56:06,715 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 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-25 14:56:06,716 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 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-25 14:56:06,717 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 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-25 14:56:06,717 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 635 transitions.
[2023-10-25 14:56:06,717 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 128 transitions, 725 flow
[2023-10-25 14:56:06,720 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:06,723 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2023-10-25 14:56:06,723 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=73, PETRI_TRANSITIONS=108}
[2023-10-25 14:56:06,724 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2023-10-25 14:56:06,724 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2023-10-25 14:56:06,725 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 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-25 14:56:06,725 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:06,725 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:06,725 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 14:56:06,726 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 14:56:06,726 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:06,726 INFO  L85        PathProgramCache]: Analyzing trace with hash -1543790880, now seen corresponding path program 1 times
[2023-10-25 14:56:06,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:06,726 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597842967]
[2023-10-25 14:56:06,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:06,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:06,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:07,144 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-25 14:56:07,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:07,157 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597842967]
[2023-10-25 14:56:07,157 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597842967] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:07,158 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:07,158 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:07,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659682009]
[2023-10-25 14:56:07,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:07,158 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:07,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:07,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:07,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:07,315 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 193
[2023-10-25 14:56:07,316 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 108 transitions, 637 flow. Second operand  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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-25 14:56:07,316 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:07,316 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 193
[2023-10-25 14:56:07,316 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:07,739 INFO  L130       PetriNetUnfolder]: 402/1014 cut-off events.
[2023-10-25 14:56:07,740 INFO  L131       PetriNetUnfolder]: For 761/769 co-relation queries the response was YES.
[2023-10-25 14:56:07,741 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 1014 events. 402/1014 cut-off events. For 761/769 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6010 event pairs, 103 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 3282. Up to 729 conditions per place. 
[2023-10-25 14:56:07,745 INFO  L137   encePairwiseOnDemand]: 171/193 looper letters, 105 selfloop transitions, 76 changer transitions 24/218 dead transitions.
[2023-10-25 14:56:07,745 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 218 transitions, 1523 flow
[2023-10-25 14:56:07,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:07,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:07,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions.
[2023-10-25 14:56:07,747 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5474956822107081
[2023-10-25 14:56:07,747 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 634 transitions.
[2023-10-25 14:56:07,747 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions.
[2023-10-25 14:56:07,747 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:07,748 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions.
[2023-10-25 14:56:07,749 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 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-25 14:56:07,763 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 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-25 14:56:07,765 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 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-25 14:56:07,765 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 634 transitions.
[2023-10-25 14:56:07,765 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 218 transitions, 1523 flow
[2023-10-25 14:56:07,769 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 218 transitions, 1523 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:07,773 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2023-10-25 14:56:07,773 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=81, PETRI_TRANSITIONS=174}
[2023-10-25 14:56:07,775 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2023-10-25 14:56:07,775 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2023-10-25 14:56:07,775 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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-25 14:56:07,776 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:07,776 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-25 14:56:07,776 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 14:56:07,776 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2023-10-25 14:56:07,776 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:07,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -1557923308, now seen corresponding path program 1 times
[2023-10-25 14:56:07,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:07,777 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867570134]
[2023-10-25 14:56:07,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:07,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:07,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 14:56:07,825 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 14:56:07,855 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 14:56:07,886 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 14:56:07,893 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 14:56:07,894 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2023-10-25 14:56:07,896 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2023-10-25 14:56:07,896 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2023-10-25 14:56:07,896 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2023-10-25 14:56:07,896 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2023-10-25 14:56:07,897 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2023-10-25 14:56:07,900 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2023-10-25 14:56:07,901 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2023-10-25 14:56:07,913 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2023-10-25 14:56:07,913 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2023-10-25 14:56:07,914 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2023-10-25 14:56:07,914 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 14:56:07,914 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:07,918 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 14:56:07,918 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 14:56:07,952 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-25 14:56:07,970 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:08,012 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2023-10-25 14:56:08,013 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 14:56:08,013 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 289 events. 11/289 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 710 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. 
[2023-10-25 14:56:08,013 INFO  L82        GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:08,014 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:08,014 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 14:56:08,015 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:08,015 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:08,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2023-10-25 14:56:08,061 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2023-10-25 14:56:08,061 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 14:56:08,061 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 289 events. 11/289 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 710 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. 
[2023-10-25 14:56:08,064 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5220
[2023-10-25 14:56:10,899 INFO  L134        LiptonReduction]: Checked pairs total: 30411
[2023-10-25 14:56:10,899 INFO  L136        LiptonReduction]: Total number of compositions: 82
[2023-10-25 14:56:10,901 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 14:56:10,901 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;@b8bcd7c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 14:56:10,901 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-10-25 14:56:10,902 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-10-25 14:56:10,902 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 14:56:10,902 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:10,902 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-25 14:56:10,902 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:10,903 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:10,903 INFO  L85        PathProgramCache]: Analyzing trace with hash 617, now seen corresponding path program 1 times
[2023-10-25 14:56:10,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:10,903 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566894758]
[2023-10-25 14:56:10,903 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:10,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:10,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:10,919 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-25 14:56:10,925 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:10,925 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566894758]
[2023-10-25 14:56:10,926 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566894758] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:10,926 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:10,926 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-25 14:56:10,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006673532]
[2023-10-25 14:56:10,926 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:10,926 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 14:56:10,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:10,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 14:56:10,929 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 14:56:10,929 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 217
[2023-10-25 14:56:10,929 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand  has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 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-25 14:56:10,929 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:10,929 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 217
[2023-10-25 14:56:10,930 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:11,211 INFO  L130       PetriNetUnfolder]: 411/1257 cut-off events.
[2023-10-25 14:56:11,211 INFO  L131       PetriNetUnfolder]: For 71/158 co-relation queries the response was YES.
[2023-10-25 14:56:11,213 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1257 events. 411/1257 cut-off events. For 71/158 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8092 event pairs, 404 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 1664. Up to 731 conditions per place. 
[2023-10-25 14:56:11,216 INFO  L137   encePairwiseOnDemand]: 216/217 looper letters, 22 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2023-10-25 14:56:11,216 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 188 flow
[2023-10-25 14:56:11,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 14:56:11,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 14:56:11,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions.
[2023-10-25 14:56:11,218 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6428571428571429
[2023-10-25 14:56:11,218 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 279 transitions.
[2023-10-25 14:56:11,218 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 279 transitions.
[2023-10-25 14:56:11,218 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:11,218 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 279 transitions.
[2023-10-25 14:56:11,219 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 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-25 14:56:11,219 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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-25 14:56:11,220 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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-25 14:56:11,220 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 279 transitions.
[2023-10-25 14:56:11,220 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 188 flow
[2023-10-25 14:56:11,221 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:11,223 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2023-10-25 14:56:11,223 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2023-10-25 14:56:11,224 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2023-10-25 14:56:11,224 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2023-10-25 14:56:11,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 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-25 14:56:11,227 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:11,229 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:11,229 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-25 14:56:11,229 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:11,229 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:11,229 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578260816, now seen corresponding path program 1 times
[2023-10-25 14:56:11,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:11,230 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017605954]
[2023-10-25 14:56:11,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:11,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:11,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:11,469 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-25 14:56:11,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:11,470 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017605954]
[2023-10-25 14:56:11,470 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017605954] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:11,470 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:11,470 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:11,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874167185]
[2023-10-25 14:56:11,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:11,471 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:11,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:11,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:11,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:11,724 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217
[2023-10-25 14:56:11,725 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 144 flow. Second operand  has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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-25 14:56:11,725 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:11,725 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217
[2023-10-25 14:56:11,725 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:13,295 INFO  L130       PetriNetUnfolder]: 5742/10965 cut-off events.
[2023-10-25 14:56:13,296 INFO  L131       PetriNetUnfolder]: For 239/274 co-relation queries the response was YES.
[2023-10-25 14:56:13,325 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20646 conditions, 10965 events. 5742/10965 cut-off events. For 239/274 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 81958 event pairs, 1527 based on Foata normal form. 16/10301 useless extension candidates. Maximal degree in co-relation 20641. Up to 5895 conditions per place. 
[2023-10-25 14:56:13,384 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 93 selfloop transitions, 48 changer transitions 0/158 dead transitions.
[2023-10-25 14:56:13,385 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 158 transitions, 627 flow
[2023-10-25 14:56:13,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:13,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:13,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions.
[2023-10-25 14:56:13,388 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5668202764976958
[2023-10-25 14:56:13,388 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 738 transitions.
[2023-10-25 14:56:13,388 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions.
[2023-10-25 14:56:13,388 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:13,390 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions.
[2023-10-25 14:56:13,400 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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-25 14:56:13,411 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-25 14:56:13,417 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-25 14:56:13,417 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 738 transitions.
[2023-10-25 14:56:13,417 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 158 transitions, 627 flow
[2023-10-25 14:56:13,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 158 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:13,420 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2023-10-25 14:56:13,420 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-10-25 14:56:13,421 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-10-25 14:56:13,421 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2023-10-25 14:56:13,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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-25 14:56:13,421 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:13,421 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:13,421 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-25 14:56:13,422 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:13,422 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:13,437 INFO  L85        PathProgramCache]: Analyzing trace with hash 933296301, now seen corresponding path program 1 times
[2023-10-25 14:56:13,437 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:13,437 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783474628]
[2023-10-25 14:56:13,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:13,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:13,445 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:13,454 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-25 14:56:13,454 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:13,454 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783474628]
[2023-10-25 14:56:13,454 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783474628] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:13,454 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:13,454 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 14:56:13,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377756658]
[2023-10-25 14:56:13,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:13,455 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 14:56:13,460 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:13,460 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 14:56:13,460 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 14:56:13,471 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2023-10-25 14:56:13,471 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-25 14:56:13,471 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:13,471 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2023-10-25 14:56:13,485 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:14,307 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_71| v_~datas~0.base_81)) (.cse1 (* v_threadThread1of2ForFork0_~i~0_29 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet4_30| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_71))) (= |v_threadThread1of2ForFork0_#t~nondet4_30| (select .cse0 (+ .cse1 v_~datas~0.offset_71))) (= (select .cse0 (+ .cse1 v_~datas~0.offset_71 1)) |v_threadThread1of2ForFork0_#t~nondet4_30|) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= |v_threadThread1of2ForFork0_#res.base_9| 0) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_71)) |v_threadThread1of2ForFork0_#t~nondet4_30|)))  InVars {#race=|v_#race_71|, ~datas~0.base=v_~datas~0.base_81, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_29, ~datas~0.offset=v_~datas~0.offset_71, threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_30|}  OutVars{#race=|v_#race_71|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, threadThread1of2ForFork0_#t~nondet3=|v_threadThread1of2ForFork0_#t~nondet3_17|, ~datas~0.base=v_~datas~0.base_81, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_29, ~datas~0.offset=v_~datas~0.offset_71}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet3, threadThread1of2ForFork0_#t~nondet4][58], [Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 141#true, 2#ULTIMATE.startEXITtrue, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#true, threadThread2of2ForFork0InUse, 47#threadEXITtrue, 21#L1016-4true, 155#(= |#race~datas~0| 0)])
[2023-10-25 14:56:14,308 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,308 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L1016-4-->L1016-6: Formula: (= (store |v_#race_60| v_~datas~0.base_57 (store (select |v_#race_60| v_~datas~0.base_57) (+ (* v_threadThread2of2ForFork0_~i~0_19 4) v_~datas~0.offset_51) |v_threadThread2of2ForFork0_#t~nondet4_21|)) |v_#race_59|)  InVars {#race=|v_#race_60|, ~datas~0.base=v_~datas~0.base_57, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_19}  OutVars{#race=|v_#race_59|, ~datas~0.base=v_~datas~0.base_57, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_21|, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][91], [Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 2#ULTIMATE.startEXITtrue, 141#true, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#true, Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 123#L1016-6true, 64#L1016-9true, 155#(= |#race~datas~0| 0)])
[2023-10-25 14:56:14,308 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,309 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,309 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,309 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2023-10-25 14:56:14,493 INFO  L130       PetriNetUnfolder]: 2751/6463 cut-off events.
[2023-10-25 14:56:14,509 INFO  L131       PetriNetUnfolder]: For 1904/2456 co-relation queries the response was YES.
[2023-10-25 14:56:14,518 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14861 conditions, 6463 events. 2751/6463 cut-off events. For 1904/2456 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53231 event pairs, 924 based on Foata normal form. 125/6164 useless extension candidates. Maximal degree in co-relation 14851. Up to 2371 conditions per place. 
[2023-10-25 14:56:14,555 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2023-10-25 14:56:14,560 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2023-10-25 14:56:14,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 14:56:14,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 14:56:14,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions.
[2023-10-25 14:56:14,577 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5990783410138248
[2023-10-25 14:56:14,577 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 390 transitions.
[2023-10-25 14:56:14,578 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions.
[2023-10-25 14:56:14,578 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:14,578 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions.
[2023-10-25 14:56:14,579 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-25 14:56:14,580 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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-25 14:56:14,580 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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-25 14:56:14,580 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 390 transitions.
[2023-10-25 14:56:14,580 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2023-10-25 14:56:14,609 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:14,611 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2023-10-25 14:56:14,611 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2023-10-25 14:56:14,612 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2023-10-25 14:56:14,612 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2023-10-25 14:56:14,613 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-25 14:56:14,613 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:14,613 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:14,613 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-25 14:56:14,613 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:14,614 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:14,614 INFO  L85        PathProgramCache]: Analyzing trace with hash -2101318696, now seen corresponding path program 1 times
[2023-10-25 14:56:14,614 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:14,614 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58661089]
[2023-10-25 14:56:14,614 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:14,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:14,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:14,918 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-25 14:56:14,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:14,919 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58661089]
[2023-10-25 14:56:14,919 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58661089] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:14,919 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:14,919 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:14,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753077162]
[2023-10-25 14:56:14,920 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:14,920 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:14,920 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:14,921 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:14,921 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:15,190 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2023-10-25 14:56:15,190 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 501 flow. Second operand  has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 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-25 14:56:15,190 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:15,190 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2023-10-25 14:56:15,191 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:17,010 INFO  L130       PetriNetUnfolder]: 5675/10752 cut-off events.
[2023-10-25 14:56:17,020 INFO  L131       PetriNetUnfolder]: For 6509/6607 co-relation queries the response was YES.
[2023-10-25 14:56:17,045 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28674 conditions, 10752 events. 5675/10752 cut-off events. For 6509/6607 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 79142 event pairs, 1877 based on Foata normal form. 0/10235 useless extension candidates. Maximal degree in co-relation 28663. Up to 6983 conditions per place. 
[2023-10-25 14:56:17,105 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 110 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2023-10-25 14:56:17,105 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1313 flow
[2023-10-25 14:56:17,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:17,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:17,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions.
[2023-10-25 14:56:17,123 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821812596006144
[2023-10-25 14:56:17,123 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 758 transitions.
[2023-10-25 14:56:17,123 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions.
[2023-10-25 14:56:17,123 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:17,124 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions.
[2023-10-25 14:56:17,125 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 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-25 14:56:17,126 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-25 14:56:17,127 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-25 14:56:17,127 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 758 transitions.
[2023-10-25 14:56:17,127 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1313 flow
[2023-10-25 14:56:17,144 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1313 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:17,159 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2023-10-25 14:56:17,159 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1155, PETRI_PLACES=87, PETRI_TRANSITIONS=180}
[2023-10-25 14:56:17,160 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2023-10-25 14:56:17,160 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2023-10-25 14:56:17,161 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 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-25 14:56:17,161 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:17,161 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:17,161 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-25 14:56:17,161 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:17,161 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:17,171 INFO  L85        PathProgramCache]: Analyzing trace with hash 1490734773, now seen corresponding path program 1 times
[2023-10-25 14:56:17,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:17,172 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586070323]
[2023-10-25 14:56:17,172 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:17,172 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:17,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:17,502 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-25 14:56:17,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:17,503 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586070323]
[2023-10-25 14:56:17,503 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586070323] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:17,503 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:17,503 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:17,503 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353068381]
[2023-10-25 14:56:17,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:17,504 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:17,504 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:17,505 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:17,505 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:17,678 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-10-25 14:56:17,679 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 180 transitions, 1155 flow. Second operand  has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 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-25 14:56:17,679 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:17,679 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-10-25 14:56:17,679 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:20,547 INFO  L130       PetriNetUnfolder]: 11355/20109 cut-off events.
[2023-10-25 14:56:20,548 INFO  L131       PetriNetUnfolder]: For 18604/18765 co-relation queries the response was YES.
[2023-10-25 14:56:20,578 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64116 conditions, 20109 events. 11355/20109 cut-off events. For 18604/18765 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 151214 event pairs, 3272 based on Foata normal form. 0/18815 useless extension candidates. Maximal degree in co-relation 64100. Up to 13848 conditions per place. 
[2023-10-25 14:56:20,726 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 239 selfloop transitions, 132 changer transitions 0/389 dead transitions.
[2023-10-25 14:56:20,727 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 389 transitions, 2939 flow
[2023-10-25 14:56:20,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:20,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:20,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2023-10-25 14:56:20,730 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2023-10-25 14:56:20,730 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2023-10-25 14:56:20,730 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2023-10-25 14:56:20,730 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:20,731 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2023-10-25 14:56:20,732 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 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-25 14:56:20,734 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-25 14:56:20,735 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-25 14:56:20,735 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 778 transitions.
[2023-10-25 14:56:20,735 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 389 transitions, 2939 flow
[2023-10-25 14:56:20,813 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 389 transitions, 2939 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:20,818 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2023-10-25 14:56:20,833 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2326, PETRI_PLACES=96, PETRI_TRANSITIONS=302}
[2023-10-25 14:56:20,834 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2023-10-25 14:56:20,834 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2023-10-25 14:56:20,834 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 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-25 14:56:20,835 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:20,835 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:20,835 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 14:56:20,835 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:20,835 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:20,836 INFO  L85        PathProgramCache]: Analyzing trace with hash -686777030, now seen corresponding path program 1 times
[2023-10-25 14:56:20,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:20,836 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123803007]
[2023-10-25 14:56:20,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:20,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:20,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:21,342 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 14:56:21,358 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:21,358 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123803007]
[2023-10-25 14:56:21,358 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123803007] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:21,360 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138299074]
[2023-10-25 14:56:21,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:21,360 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:21,360 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:21,374 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-25 14:56:21,417 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-25 14:56:21,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:21,529 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2023-10-25 14:56:21,550 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:21,750 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-25 14:56:21,788 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:21,790 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-25 14:56:21,832 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:21,833 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:21,834 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-25 14:56:21,887 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:21,888 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:21,889 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:21,890 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-25 14:56:21,960 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:21,961 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-25 14:56:21,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-25 14:56:21,991 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:56:22,141 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_ArrVal_318 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-10-25 14:56:22,169 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 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|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2023-10-25 14:56:22,244 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2023-10-25 14:56:22,245 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138299074] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:56:22,245 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:56:22,245 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15
[2023-10-25 14:56:22,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352291606]
[2023-10-25 14:56:22,245 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:56:22,246 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2023-10-25 14:56:22,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:22,247 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2023-10-25 14:56:22,247 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=8, NotChecked=54, Total=272
[2023-10-25 14:56:22,255 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 217
[2023-10-25 14:56:22,256 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 302 transitions, 2326 flow. Second operand  has 17 states, 17 states have (on average 81.3529411764706) internal successors, (1383), 17 states have internal predecessors, (1383), 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-25 14:56:22,256 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:22,256 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 217
[2023-10-25 14:56:22,257 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:26,078 INFO  L130       PetriNetUnfolder]: 14603/24245 cut-off events.
[2023-10-25 14:56:26,080 INFO  L131       PetriNetUnfolder]: For 41050/41050 co-relation queries the response was YES.
[2023-10-25 14:56:26,152 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94260 conditions, 24245 events. 14603/24245 cut-off events. For 41050/41050 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 173289 event pairs, 3234 based on Foata normal form. 162/22857 useless extension candidates. Maximal degree in co-relation 94239. Up to 14161 conditions per place. 
[2023-10-25 14:56:26,382 INFO  L137   encePairwiseOnDemand]: 207/217 looper letters, 500 selfloop transitions, 54 changer transitions 1/562 dead transitions.
[2023-10-25 14:56:26,382 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 562 transitions, 5374 flow
[2023-10-25 14:56:26,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 14:56:26,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 14:56:26,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions.
[2023-10-25 14:56:26,385 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46017116524028967
[2023-10-25 14:56:26,385 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 699 transitions.
[2023-10-25 14:56:26,385 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions.
[2023-10-25 14:56:26,386 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:26,386 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions.
[2023-10-25 14:56:26,387 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 99.85714285714286) internal successors, (699), 7 states have internal predecessors, (699), 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-25 14:56:26,400 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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-25 14:56:26,401 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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-25 14:56:26,401 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 699 transitions.
[2023-10-25 14:56:26,401 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 562 transitions, 5374 flow
[2023-10-25 14:56:26,914 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 562 transitions, 5278 flow, removed 48 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:26,919 INFO  L231             Difference]: Finished difference. Result has 102 places, 314 transitions, 2506 flow
[2023-10-25 14:56:26,920 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2506, PETRI_PLACES=102, PETRI_TRANSITIONS=314}
[2023-10-25 14:56:26,921 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 35 predicate places.
[2023-10-25 14:56:26,921 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 314 transitions, 2506 flow
[2023-10-25 14:56:26,921 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 81.3529411764706) internal successors, (1383), 17 states have internal predecessors, (1383), 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-25 14:56:26,921 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:26,922 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:26,944 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-25 14:56:27,126 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-10-25 14:56:27,127 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:27,127 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:27,128 INFO  L85        PathProgramCache]: Analyzing trace with hash -1154275821, now seen corresponding path program 1 times
[2023-10-25 14:56:27,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:27,128 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776912732]
[2023-10-25 14:56:27,128 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:27,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:27,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:27,542 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 14:56:27,542 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:27,542 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776912732]
[2023-10-25 14:56:27,542 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776912732] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:27,542 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:27,542 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-25 14:56:27,543 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285341766]
[2023-10-25 14:56:27,543 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:27,544 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-25 14:56:27,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:27,544 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-25 14:56:27,544 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-25 14:56:27,880 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217
[2023-10-25 14:56:27,881 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 314 transitions, 2506 flow. Second operand  has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 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-25 14:56:27,881 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:27,881 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217
[2023-10-25 14:56:27,881 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:31,758 INFO  L130       PetriNetUnfolder]: 13820/24388 cut-off events.
[2023-10-25 14:56:31,771 INFO  L131       PetriNetUnfolder]: For 46821/46988 co-relation queries the response was YES.
[2023-10-25 14:56:31,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 97397 conditions, 24388 events. 13820/24388 cut-off events. For 46821/46988 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 189841 event pairs, 3201 based on Foata normal form. 348/24232 useless extension candidates. Maximal degree in co-relation 97374. Up to 11426 conditions per place. 
[2023-10-25 14:56:31,967 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 462 selfloop transitions, 166 changer transitions 2/647 dead transitions.
[2023-10-25 14:56:31,967 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 647 transitions, 6020 flow
[2023-10-25 14:56:31,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-25 14:56:31,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-25 14:56:31,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 973 transitions.
[2023-10-25 14:56:31,969 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5604838709677419
[2023-10-25 14:56:31,969 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 973 transitions.
[2023-10-25 14:56:31,970 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 973 transitions.
[2023-10-25 14:56:31,970 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:31,982 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 973 transitions.
[2023-10-25 14:56:31,985 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 121.625) internal successors, (973), 8 states have internal predecessors, (973), 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-25 14:56:31,986 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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-25 14:56:31,987 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 217.0) internal successors, (1953), 9 states have internal predecessors, (1953), 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-25 14:56:31,987 INFO  L175             Difference]: Start difference. First operand has 102 places, 314 transitions, 2506 flow. Second operand 8 states and 973 transitions.
[2023-10-25 14:56:31,987 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 647 transitions, 6020 flow
[2023-10-25 14:56:32,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 647 transitions, 5921 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-10-25 14:56:32,326 INFO  L231             Difference]: Finished difference. Result has 111 places, 430 transitions, 4113 flow
[2023-10-25 14:56:32,327 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4113, PETRI_PLACES=111, PETRI_TRANSITIONS=430}
[2023-10-25 14:56:32,328 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 44 predicate places.
[2023-10-25 14:56:32,328 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 430 transitions, 4113 flow
[2023-10-25 14:56:32,329 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 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-25 14:56:32,329 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:32,329 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]
[2023-10-25 14:56:32,329 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-25 14:56:32,329 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:32,330 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:32,330 INFO  L85        PathProgramCache]: Analyzing trace with hash 340394548, now seen corresponding path program 1 times
[2023-10-25 14:56:32,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:32,330 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109328408]
[2023-10-25 14:56:32,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:32,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:32,350 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:32,398 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-25 14:56:32,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:32,399 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109328408]
[2023-10-25 14:56:32,412 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109328408] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:32,412 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114449251]
[2023-10-25 14:56:32,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:32,412 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:32,412 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:32,413 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-25 14:56:32,448 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-25 14:56:32,563 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:32,564 INFO  L263         TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 14:56:32,565 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:32,601 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-25 14:56:32,601 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:56:32,629 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-25 14:56:32,629 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114449251] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:56:32,629 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:56:32,629 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2023-10-25 14:56:32,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718510539]
[2023-10-25 14:56:32,630 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:56:32,630 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-10-25 14:56:32,630 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:32,631 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-10-25 14:56:32,631 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2023-10-25 14:56:32,784 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2023-10-25 14:56:32,785 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 430 transitions, 4113 flow. Second operand  has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 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-25 14:56:32,785 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:32,785 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2023-10-25 14:56:32,785 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:34,774 INFO  L130       PetriNetUnfolder]: 5754/12879 cut-off events.
[2023-10-25 14:56:34,775 INFO  L131       PetriNetUnfolder]: For 42791/44813 co-relation queries the response was YES.
[2023-10-25 14:56:34,806 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55285 conditions, 12879 events. 5754/12879 cut-off events. For 42791/44813 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 112058 event pairs, 470 based on Foata normal form. 202/12746 useless extension candidates. Maximal degree in co-relation 55256. Up to 5114 conditions per place. 
[2023-10-25 14:56:34,843 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 152 selfloop transitions, 5 changer transitions 23/483 dead transitions.
[2023-10-25 14:56:34,843 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 483 transitions, 4821 flow
[2023-10-25 14:56:34,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 14:56:34,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 14:56:34,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions.
[2023-10-25 14:56:34,861 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5766951942067149
[2023-10-25 14:56:34,861 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 876 transitions.
[2023-10-25 14:56:34,861 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions.
[2023-10-25 14:56:34,861 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:34,861 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions.
[2023-10-25 14:56:34,863 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 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-25 14:56:34,875 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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-25 14:56:34,876 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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-25 14:56:34,876 INFO  L175             Difference]: Start difference. First operand has 111 places, 430 transitions, 4113 flow. Second operand 7 states and 876 transitions.
[2023-10-25 14:56:34,876 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 483 transitions, 4821 flow
[2023-10-25 14:56:35,128 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 483 transitions, 4807 flow, removed 7 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:35,132 INFO  L231             Difference]: Finished difference. Result has 120 places, 390 transitions, 3685 flow
[2023-10-25 14:56:35,132 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3757, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3685, PETRI_PLACES=120, PETRI_TRANSITIONS=390}
[2023-10-25 14:56:35,134 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 53 predicate places.
[2023-10-25 14:56:35,134 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 390 transitions, 3685 flow
[2023-10-25 14:56:35,134 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 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-25 14:56:35,135 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:35,135 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]
[2023-10-25 14:56:35,141 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-25 14:56:35,339 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:35,339 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:35,340 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:35,340 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108254852, now seen corresponding path program 1 times
[2023-10-25 14:56:35,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:35,341 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105593241]
[2023-10-25 14:56:35,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:35,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:35,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:35,734 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-25 14:56:35,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:35,734 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105593241]
[2023-10-25 14:56:35,734 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105593241] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:35,735 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:35,735 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-25 14:56:35,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974370190]
[2023-10-25 14:56:35,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:35,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-25 14:56:35,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:35,737 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-25 14:56:35,737 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-25 14:56:36,146 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-10-25 14:56:36,147 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 390 transitions, 3685 flow. Second operand  has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 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-25 14:56:36,147 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:36,147 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-10-25 14:56:36,147 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:38,518 INFO  L130       PetriNetUnfolder]: 8771/16346 cut-off events.
[2023-10-25 14:56:38,519 INFO  L131       PetriNetUnfolder]: For 65738/66133 co-relation queries the response was YES.
[2023-10-25 14:56:38,556 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77526 conditions, 16346 events. 8771/16346 cut-off events. For 65738/66133 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 123613 event pairs, 2787 based on Foata normal form. 240/16416 useless extension candidates. Maximal degree in co-relation 77493. Up to 13560 conditions per place. 
[2023-10-25 14:56:38,603 INFO  L137   encePairwiseOnDemand]: 209/217 looper letters, 343 selfloop transitions, 13 changer transitions 7/402 dead transitions.
[2023-10-25 14:56:38,604 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 402 transitions, 4497 flow
[2023-10-25 14:56:38,604 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 14:56:38,604 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 14:56:38,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions.
[2023-10-25 14:56:38,619 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48847926267281105
[2023-10-25 14:56:38,619 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 742 transitions.
[2023-10-25 14:56:38,625 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 742 transitions.
[2023-10-25 14:56:38,625 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:38,625 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 742 transitions.
[2023-10-25 14:56:38,626 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 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-25 14:56:38,628 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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-25 14:56:38,628 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 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-25 14:56:38,628 INFO  L175             Difference]: Start difference. First operand has 120 places, 390 transitions, 3685 flow. Second operand 7 states and 742 transitions.
[2023-10-25 14:56:38,629 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 402 transitions, 4497 flow
[2023-10-25 14:56:38,845 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 402 transitions, 4408 flow, removed 6 selfloop flow, removed 3 redundant places.
[2023-10-25 14:56:38,851 INFO  L231             Difference]: Finished difference. Result has 122 places, 388 transitions, 3635 flow
[2023-10-25 14:56:38,851 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3592, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3635, PETRI_PLACES=122, PETRI_TRANSITIONS=388}
[2023-10-25 14:56:38,852 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 55 predicate places.
[2023-10-25 14:56:38,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 388 transitions, 3635 flow
[2023-10-25 14:56:38,853 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 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-25 14:56:38,853 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:38,853 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:38,854 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-25 14:56:38,854 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:38,869 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:38,869 INFO  L85        PathProgramCache]: Analyzing trace with hash 860099489, now seen corresponding path program 1 times
[2023-10-25 14:56:38,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:38,870 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375382967]
[2023-10-25 14:56:38,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:38,870 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:38,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:39,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-25 14:56:39,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:39,184 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375382967]
[2023-10-25 14:56:39,185 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375382967] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:39,185 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:39,187 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:39,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854109345]
[2023-10-25 14:56:39,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:39,190 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:39,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:39,190 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:39,191 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:39,324 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2023-10-25 14:56:39,324 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 388 transitions, 3635 flow. Second operand  has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 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-25 14:56:39,324 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:39,324 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2023-10-25 14:56:39,324 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:42,837 INFO  L130       PetriNetUnfolder]: 12785/22892 cut-off events.
[2023-10-25 14:56:42,838 INFO  L131       PetriNetUnfolder]: For 82124/82522 co-relation queries the response was YES.
[2023-10-25 14:56:42,889 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105773 conditions, 22892 events. 12785/22892 cut-off events. For 82124/82522 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 175862 event pairs, 2816 based on Foata normal form. 45/21734 useless extension candidates. Maximal degree in co-relation 105739. Up to 17260 conditions per place. 
[2023-10-25 14:56:42,981 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 405 selfloop transitions, 156 changer transitions 18/594 dead transitions.
[2023-10-25 14:56:42,981 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 594 transitions, 6405 flow
[2023-10-25 14:56:42,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:42,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:42,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2023-10-25 14:56:42,983 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2023-10-25 14:56:42,983 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2023-10-25 14:56:42,983 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2023-10-25 14:56:42,983 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:42,984 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2023-10-25 14:56:42,985 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 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-25 14:56:43,001 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-25 14:56:43,002 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-25 14:56:43,002 INFO  L175             Difference]: Start difference. First operand has 122 places, 388 transitions, 3635 flow. Second operand 6 states and 778 transitions.
[2023-10-25 14:56:43,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 594 transitions, 6405 flow
[2023-10-25 14:56:43,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 594 transitions, 6347 flow, removed 1 selfloop flow, removed 3 redundant places.
[2023-10-25 14:56:43,394 INFO  L231             Difference]: Finished difference. Result has 128 places, 501 transitions, 5166 flow
[2023-10-25 14:56:43,394 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3601, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5166, PETRI_PLACES=128, PETRI_TRANSITIONS=501}
[2023-10-25 14:56:43,395 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 61 predicate places.
[2023-10-25 14:56:43,395 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 501 transitions, 5166 flow
[2023-10-25 14:56:43,395 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 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-25 14:56:43,395 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:43,395 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]
[2023-10-25 14:56:43,396 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-10-25 14:56:43,396 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:43,396 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:43,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -907237555, now seen corresponding path program 1 times
[2023-10-25 14:56:43,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:43,397 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430272763]
[2023-10-25 14:56:43,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:43,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:43,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:44,054 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-25 14:56:44,054 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:44,054 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430272763]
[2023-10-25 14:56:44,055 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430272763] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:44,055 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266645627]
[2023-10-25 14:56:44,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:44,055 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:44,055 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:44,056 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-25 14:56:44,093 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-25 14:56:44,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:44,205 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 61 conjunts are in the unsatisfiable core
[2023-10-25 14:56:44,209 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:44,247 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2023-10-25 14:56:44,248 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 35 treesize of output 27
[2023-10-25 14:56:44,448 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 14:56:44,449 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36
[2023-10-25 14:56:44,470 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 18 treesize of output 20
[2023-10-25 14:56:44,681 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 23 treesize of output 23
[2023-10-25 14:56:44,691 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 14 treesize of output 16
[2023-10-25 14:56:44,722 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12
[2023-10-25 14:56:44,728 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3
[2023-10-25 14:56:44,788 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 15 treesize of output 11
[2023-10-25 14:56:44,833 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 28 treesize of output 27
[2023-10-25 14:56:44,878 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 40 treesize of output 42
[2023-10-25 14:56:44,940 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 52 treesize of output 57
[2023-10-25 14:56:45,028 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 54 treesize of output 50
[2023-10-25 14:56:45,073 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-25 14:56:45,073 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:56:45,110 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_635 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_635 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_635 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_635 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))))) is different from false
[2023-10-25 14:56:45,153 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_635 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_635 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_635 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_635 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))))))) is different from false
[2023-10-25 14:56:45,185 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse1)) (.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_635 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_635 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_635 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_635 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false
[2023-10-25 14:56:45,469 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-25 14:56:45,470 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266645627] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:56:45,470 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:56:45,470 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28
[2023-10-25 14:56:45,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210098545]
[2023-10-25 14:56:45,470 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:56:45,470 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2023-10-25 14:56:45,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:45,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2023-10-25 14:56:45,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=563, Unknown=13, NotChecked=156, Total=870
[2023-10-25 14:56:45,548 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 217
[2023-10-25 14:56:45,549 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 501 transitions, 5166 flow. Second operand  has 30 states, 30 states have (on average 62.63333333333333) internal successors, (1879), 30 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-25 14:56:45,549 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:45,549 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 217
[2023-10-25 14:56:45,549 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:54,912 INFO  L130       PetriNetUnfolder]: 22932/37829 cut-off events.
[2023-10-25 14:56:54,913 INFO  L131       PetriNetUnfolder]: For 169052/169052 co-relation queries the response was YES.
[2023-10-25 14:56:55,039 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 191689 conditions, 37829 events. 22932/37829 cut-off events. For 169052/169052 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 281371 event pairs, 4233 based on Foata normal form. 273/38102 useless extension candidates. Maximal degree in co-relation 191651. Up to 14746 conditions per place. 
[2023-10-25 14:56:55,224 INFO  L137   encePairwiseOnDemand]: 182/217 looper letters, 1158 selfloop transitions, 421 changer transitions 48/1630 dead transitions.
[2023-10-25 14:56:55,224 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 1630 transitions, 19732 flow
[2023-10-25 14:56:55,225 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-25 14:56:55,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-25 14:56:55,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1621 transitions.
[2023-10-25 14:56:55,229 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35571648014044327
[2023-10-25 14:56:55,229 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1621 transitions.
[2023-10-25 14:56:55,229 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1621 transitions.
[2023-10-25 14:56:55,230 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:55,230 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1621 transitions.
[2023-10-25 14:56:55,255 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 77.19047619047619) internal successors, (1621), 21 states have internal predecessors, (1621), 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-25 14:56:55,260 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 217.0) internal successors, (4774), 22 states have internal predecessors, (4774), 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-25 14:56:55,261 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 217.0) internal successors, (4774), 22 states have internal predecessors, (4774), 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-25 14:56:55,261 INFO  L175             Difference]: Start difference. First operand has 128 places, 501 transitions, 5166 flow. Second operand 21 states and 1621 transitions.
[2023-10-25 14:56:55,262 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 1630 transitions, 19732 flow
[2023-10-25 14:56:56,812 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 1630 transitions, 19410 flow, removed 161 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:56,825 INFO  L231             Difference]: Finished difference. Result has 158 places, 888 transitions, 11320 flow
[2023-10-25 14:56:56,825 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=5000, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=11320, PETRI_PLACES=158, PETRI_TRANSITIONS=888}
[2023-10-25 14:56:56,826 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 91 predicate places.
[2023-10-25 14:56:56,826 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 888 transitions, 11320 flow
[2023-10-25 14:56:56,835 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 62.63333333333333) internal successors, (1879), 30 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-25 14:56:56,836 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:56,836 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]
[2023-10-25 14:56:56,842 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-25 14:56:57,040 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-10-25 14:56:57,040 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:56:57,041 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:57,041 INFO  L85        PathProgramCache]: Analyzing trace with hash -103982335, now seen corresponding path program 2 times
[2023-10-25 14:56:57,041 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:57,042 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468526046]
[2023-10-25 14:56:57,042 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:57,042 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:57,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:57,828 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-25 14:56:57,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:57,829 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468526046]
[2023-10-25 14:56:57,829 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468526046] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:57,829 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786884857]
[2023-10-25 14:56:57,829 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 14:56:57,829 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:57,829 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:57,831 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-25 14:56:57,872 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-25 14:56:57,993 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 14:56:57,993 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:56:58,011 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 69 conjunts are in the unsatisfiable core
[2023-10-25 14:56:58,017 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:58,030 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 18 treesize of output 16
[2023-10-25 14:56:58,279 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 14:56:58,280 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37
[2023-10-25 14:56:58,285 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:58,301 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 18 treesize of output 20
[2023-10-25 14:56:58,475 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 24 treesize of output 24
[2023-10-25 14:56:58,482 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 14 treesize of output 16
[2023-10-25 14:56:58,514 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 14:56:58,588 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 28 treesize of output 27
[2023-10-25 14:56:58,672 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 14:56:58,937 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3
[2023-10-25 14:56:58,943 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 13
[2023-10-25 14:56:59,011 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 42 treesize of output 40
[2023-10-25 14:56:59,037 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 14:56:59,120 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 54 treesize of output 50
[2023-10-25 14:56:59,154 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 54 treesize of output 50
[2023-10-25 14:56:59,183 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 54 treesize of output 50
[2023-10-25 14:56:59,300 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 54 treesize of output 50
[2023-10-25 14:56:59,348 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-25 14:56:59,361 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:56:59,383 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_750 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))))) is different from false
[2023-10-25 14:56:59,432 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-10-25 14:56:59,487 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) .cse2))))))) is different from false
[2023-10-25 14:56:59,520 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse3))) (and (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse0 c_~datas~0.base (store (select .cse0 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse2 c_~datas~0.base (store (select .cse2 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse3)))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse4 c_~datas~0.base (store (select .cse4 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse5 c_~datas~0.base (store (select .cse5 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 14:56:59,548 WARN  L837   $PredicateComparison]: unable to prove that (or (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse4)) (.cse2 (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_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse0 c_~datas~0.base (store (select .cse0 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) .cse2 v_ArrVal_750) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse3 c_~datas~0.base (store (select .cse3 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) .cse2 v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse5 c_~datas~0.base (store (select .cse5 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) .cse2 v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse6 c_~datas~0.base (store (select .cse6 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) .cse2 v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse4 1))))))) (not (< |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_main_~threads_total~0#1|))) is different from false
[2023-10-25 14:56:59,583 WARN  L837   $PredicateComparison]: unable to prove that (or (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse4)) (.cse2 (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_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse0 c_~datas~0.base (store (select .cse0 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) .cse2 v_ArrVal_750) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse3 c_~datas~0.base (store (select .cse3 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) .cse2 v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse5 c_~datas~0.base (store (select .cse5 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) .cse2 v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743))) (store .cse6 c_~datas~0.base (store (select .cse6 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) .cse2 v_ArrVal_750) c_~datas~0.base) (+ c_~datas~0.offset .cse4 1))))))) (not (< 0 |c_ULTIMATE.start_main_~threads_total~0#1|))) is different from false
[2023-10-25 14:56:59,985 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:59,986 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 3 case distinctions, treesize of input 96 treesize of output 79
[2023-10-25 14:56:59,992 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:59,992 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 533 treesize of output 338
[2023-10-25 14:57:00,015 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 314 treesize of output 266
[2023-10-25 14:57:00,020 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 266 treesize of output 242
[2023-10-25 14:57:00,025 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 134 treesize of output 122
[2023-10-25 14:57:00,199 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:57:00,200 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 3 case distinctions, treesize of input 97 treesize of output 1
[2023-10-25 14:57:00,205 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:57:00,206 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 3 case distinctions, treesize of input 97 treesize of output 1
[2023-10-25 14:57:00,409 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-25 14:57:00,409 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786884857] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:00,409 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:00,410 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 33
[2023-10-25 14:57:00,410 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411000290]
[2023-10-25 14:57:00,410 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:00,410 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2023-10-25 14:57:00,410 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:00,410 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2023-10-25 14:57:00,411 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=645, Unknown=19, NotChecked=354, Total=1190
[2023-10-25 14:57:00,513 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 217
[2023-10-25 14:57:00,514 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 888 transitions, 11320 flow. Second operand  has 35 states, 35 states have (on average 59.285714285714285) internal successors, (2075), 35 states have internal predecessors, (2075), 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-25 14:57:00,514 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:00,515 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 217
[2023-10-25 14:57:00,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:15,244 INFO  L130       PetriNetUnfolder]: 25870/42603 cut-off events.
[2023-10-25 14:57:15,244 INFO  L131       PetriNetUnfolder]: For 375098/375100 co-relation queries the response was YES.
[2023-10-25 14:57:15,443 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283880 conditions, 42603 events. 25870/42603 cut-off events. For 375098/375100 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 320803 event pairs, 4090 based on Foata normal form. 383/42985 useless extension candidates. Maximal degree in co-relation 283831. Up to 19027 conditions per place. 
[2023-10-25 14:57:15,607 INFO  L137   encePairwiseOnDemand]: 186/217 looper letters, 1243 selfloop transitions, 765 changer transitions 59/2070 dead transitions.
[2023-10-25 14:57:15,607 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 2070 transitions, 29101 flow
[2023-10-25 14:57:15,608 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2023-10-25 14:57:15,608 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2023-10-25 14:57:15,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2297 transitions.
[2023-10-25 14:57:15,611 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3414597889103612
[2023-10-25 14:57:15,611 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2297 transitions.
[2023-10-25 14:57:15,612 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2297 transitions.
[2023-10-25 14:57:15,621 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:15,621 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2297 transitions.
[2023-10-25 14:57:15,646 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 74.09677419354838) internal successors, (2297), 31 states have internal predecessors, (2297), 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-25 14:57:15,651 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 217.0) internal successors, (6944), 32 states have internal predecessors, (6944), 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-25 14:57:15,652 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 217.0) internal successors, (6944), 32 states have internal predecessors, (6944), 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-25 14:57:15,652 INFO  L175             Difference]: Start difference. First operand has 158 places, 888 transitions, 11320 flow. Second operand 31 states and 2297 transitions.
[2023-10-25 14:57:15,652 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 2070 transitions, 29101 flow
[2023-10-25 14:57:22,913 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 2070 transitions, 28607 flow, removed 232 selfloop flow, removed 7 redundant places.
[2023-10-25 14:57:22,936 INFO  L231             Difference]: Finished difference. Result has 192 places, 1321 transitions, 19826 flow
[2023-10-25 14:57:22,936 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=10963, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=888, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=368, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=19826, PETRI_PLACES=192, PETRI_TRANSITIONS=1321}
[2023-10-25 14:57:22,937 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 125 predicate places.
[2023-10-25 14:57:22,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 1321 transitions, 19826 flow
[2023-10-25 14:57:22,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 59.285714285714285) internal successors, (2075), 35 states have internal predecessors, (2075), 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-25 14:57:22,937 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:22,937 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]
[2023-10-25 14:57:22,943 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-25 14:57:23,142 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-25 14:57:23,157 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:57:23,158 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:23,158 INFO  L85        PathProgramCache]: Analyzing trace with hash 1590730138, now seen corresponding path program 1 times
[2023-10-25 14:57:23,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:23,159 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435778040]
[2023-10-25 14:57:23,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:23,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:23,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:23,743 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-25 14:57:23,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:23,743 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435778040]
[2023-10-25 14:57:23,743 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435778040] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:23,743 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141813267]
[2023-10-25 14:57:23,743 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:23,743 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:23,743 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:23,744 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-25 14:57:23,789 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-25 14:57:23,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:23,920 INFO  L263         TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 28 conjunts are in the unsatisfiable core
[2023-10-25 14:57:23,927 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:23,934 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:23,937 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 26 treesize of output 24
[2023-10-25 14:57:24,055 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 14:57:24,056 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 1 case distinctions, treesize of input 31 treesize of output 29
[2023-10-25 14:57:24,095 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:24,096 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 24 treesize of output 24
[2023-10-25 14:57:24,134 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-25 14:57:24,148 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 15 treesize of output 11
[2023-10-25 14:57:24,154 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 28 treesize of output 27
[2023-10-25 14:57:24,172 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:24,173 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 40 treesize of output 42
[2023-10-25 14:57:24,192 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 42 treesize of output 40
[2023-10-25 14:57:24,203 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:24,203 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 52 treesize of output 57
[2023-10-25 14:57:24,214 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-25 14:57:24,214 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 14:57:24,214 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141813267] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:57:24,214 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-25 14:57:24,214 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 12
[2023-10-25 14:57:24,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371066020]
[2023-10-25 14:57:24,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:57:24,215 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-25 14:57:24,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:24,215 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-25 14:57:24,216 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182
[2023-10-25 14:57:25,102 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217
[2023-10-25 14:57:25,102 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 1321 transitions, 19826 flow. Second operand  has 10 states, 10 states have (on average 103.7) internal successors, (1037), 10 states have internal predecessors, (1037), 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-25 14:57:25,102 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:25,102 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217
[2023-10-25 14:57:25,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:27,655 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L1025-8-->L1025-9: Formula: (let ((.cse0 (+ (* |v_ULTIMATE.start_main_~i~1#1_5| 4) |v_ULTIMATE.start_main_#t~mem11#1.offset_3|))) (and (= |v_#memory_$Pointer$.base_3| (store |v_#memory_$Pointer$.base_4| |v_ULTIMATE.start_main_#t~mem11#1.base_3| (store (select |v_#memory_$Pointer$.base_4| |v_ULTIMATE.start_main_#t~mem11#1.base_3|) .cse0 (select (select |v_#memory_$Pointer$.base_3| |v_ULTIMATE.start_main_#t~mem11#1.base_3|) .cse0)))) (= |v_#memory_$Pointer$.offset_3| (store |v_#memory_$Pointer$.offset_4| |v_ULTIMATE.start_main_#t~mem11#1.base_3| (store (select |v_#memory_$Pointer$.offset_4| |v_ULTIMATE.start_main_#t~mem11#1.base_3|) .cse0 (select (select |v_#memory_$Pointer$.offset_3| |v_ULTIMATE.start_main_#t~mem11#1.base_3|) .cse0)))) (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_#t~mem11#1.base_3| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_#t~mem11#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_1|)))  InVars {ULTIMATE.start_main_#t~mem11#1.offset=|v_ULTIMATE.start_main_#t~mem11#1.offset_3|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_5|, ULTIMATE.start_main_#t~mem11#1.base=|v_ULTIMATE.start_main_#t~mem11#1.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #memory_int=|v_#memory_int_2|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_4|}  OutVars{ULTIMATE.start_main_#t~mem11#1.offset=|v_ULTIMATE.start_main_#t~mem11#1.offset_3|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_5|, ULTIMATE.start_main_#t~mem11#1.base=|v_ULTIMATE.start_main_#t~mem11#1.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #memory_int=|v_#memory_int_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_3|}  AuxVars[]  AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][7], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 47#threadEXITtrue, 155#(= |#race~datas~0| 0), Black: 141#true, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#true, Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 153#true, 708#(and (= ~datas~0.offset 0) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 161#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 162#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 160#(= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 3 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 172#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 175#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 173#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 324#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 174#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 949#(and (= ~datas~0.offset 0) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem11#1.base|))), 170#true, 114#L1016-1true, 494#true, Black: 326#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 87#L1025-9true, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 158#true, Black: 325#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 327#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 712#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 475#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_~i~2#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 722#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= threadThread1of2ForFork0_~i~0 0) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 714#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 718#(and (= ~datas~0.offset 0) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| ~datas~0.base (store (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (forall ((v_ArrVal_635 (Array Int Int))) (= (select (select (store (store |#race| ~datas~0.base (store (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)) |threadThread1of2ForFork0_#t~nondet4|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| ~datas~0.base (store (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))))), Black: 720#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 716#(and (= ~datas~0.offset 0) (forall ((v_ArrVal_635 (Array Int Int))) (= (select (select (store (store |#race| ~datas~0.base (store (store (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))) |threadThread1of2ForFork0_#t~nondet4|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (forall ((v_ArrVal_635 (Array Int Int))) (= (select (select (store (store |#race| ~datas~0.base (store (store (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)) |threadThread1of2ForFork0_#t~nondet4|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 726#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 980#(and (= ~datas~0.offset 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base (store (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base (store (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)))) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 974#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 724#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 988#(and (= ~datas~0.offset 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)))) (= |ULTIMATE.start_main_~i~2#1| 0) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 955#(and (= ~datas~0.offset 0) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 847#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= threadThread1of2ForFork0_~i~0 0)), Black: 992#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 963#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 985#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 486#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 485#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 990#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 487#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 969#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 982#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 978#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 959#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 497#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset)))), 1028#(and (<= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 498#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset)))), Black: 499#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset))) (= (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread2of2ForFork0_#t~nondet4|)), Black: 496#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), 471#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|))])
[2023-10-25 14:57:27,658 INFO  L383   tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event
[2023-10-25 14:57:27,658 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-10-25 14:57:27,658 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-10-25 14:57:27,658 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2023-10-25 14:57:28,610 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L1016-4-->L1016-6: Formula: (= (store |v_#race_60| v_~datas~0.base_57 (store (select |v_#race_60| v_~datas~0.base_57) (+ (* v_threadThread2of2ForFork0_~i~0_19 4) v_~datas~0.offset_51) |v_threadThread2of2ForFork0_#t~nondet4_21|)) |v_#race_59|)  InVars {#race=|v_#race_60|, ~datas~0.base=v_~datas~0.base_57, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_19}  OutVars{#race=|v_#race_59|, ~datas~0.base=v_~datas~0.base_57, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_21|, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][203], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 47#threadEXITtrue, 155#(= |#race~datas~0| 0), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#true, Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 153#true, 708#(and (= ~datas~0.offset 0) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 161#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 162#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 160#(= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 3 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), 100#L1025-8true, Black: 172#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 175#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 324#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 173#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 174#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 949#(and (= ~datas~0.offset 0) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem11#1.base|))), 141#true, 123#L1016-6true, 170#true, Black: 326#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 158#true, Black: 325#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 327#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 712#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 722#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= threadThread1of2ForFork0_~i~0 0) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 475#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_~i~2#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 714#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 718#(and (= ~datas~0.offset 0) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| ~datas~0.base (store (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (forall ((v_ArrVal_635 (Array Int Int))) (= (select (select (store (store |#race| ~datas~0.base (store (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)) |threadThread1of2ForFork0_#t~nondet4|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| ~datas~0.base (store (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))))), Black: 720#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 716#(and (= ~datas~0.offset 0) (forall ((v_ArrVal_635 (Array Int Int))) (= (select (select (store (store |#race| ~datas~0.base (store (store (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))) |threadThread1of2ForFork0_#t~nondet4|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (forall ((v_ArrVal_635 (Array Int Int))) (= (select (select (store (store |#race| ~datas~0.base (store (store (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)) |threadThread1of2ForFork0_#t~nondet4|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 726#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 980#(and (= ~datas~0.offset 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base (store (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base (store (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)))) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 724#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 974#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 988#(and (= ~datas~0.offset 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)))) (= |ULTIMATE.start_main_~i~2#1| 0) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 955#(and (= ~datas~0.offset 0) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 847#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= threadThread1of2ForFork0_~i~0 0)), Black: 992#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 963#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 985#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 486#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 990#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 485#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 487#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 969#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 982#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 496#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 978#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 959#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 497#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset)))), 1028#(and (<= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 498#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset)))), Black: 499#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset))) (= (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread2of2ForFork0_#t~nondet4|)), 471#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|))])
[2023-10-25 14:57:28,625 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-10-25 14:57:28,625 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-10-25 14:57:28,626 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-10-25 14:57:28,626 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-10-25 14:57:28,626 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L1025-8-->L1025-9: Formula: (let ((.cse0 (+ (* |v_ULTIMATE.start_main_~i~1#1_5| 4) |v_ULTIMATE.start_main_#t~mem11#1.offset_3|))) (and (= |v_#memory_$Pointer$.base_3| (store |v_#memory_$Pointer$.base_4| |v_ULTIMATE.start_main_#t~mem11#1.base_3| (store (select |v_#memory_$Pointer$.base_4| |v_ULTIMATE.start_main_#t~mem11#1.base_3|) .cse0 (select (select |v_#memory_$Pointer$.base_3| |v_ULTIMATE.start_main_#t~mem11#1.base_3|) .cse0)))) (= |v_#memory_$Pointer$.offset_3| (store |v_#memory_$Pointer$.offset_4| |v_ULTIMATE.start_main_#t~mem11#1.base_3| (store (select |v_#memory_$Pointer$.offset_4| |v_ULTIMATE.start_main_#t~mem11#1.base_3|) .cse0 (select (select |v_#memory_$Pointer$.offset_3| |v_ULTIMATE.start_main_#t~mem11#1.base_3|) .cse0)))) (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_#t~mem11#1.base_3| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_#t~mem11#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre10#1_3|)) |v_#memory_int_1|)))  InVars {ULTIMATE.start_main_#t~mem11#1.offset=|v_ULTIMATE.start_main_#t~mem11#1.offset_3|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_5|, ULTIMATE.start_main_#t~mem11#1.base=|v_ULTIMATE.start_main_#t~mem11#1.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #memory_int=|v_#memory_int_2|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_4|}  OutVars{ULTIMATE.start_main_#t~mem11#1.offset=|v_ULTIMATE.start_main_#t~mem11#1.offset_3|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_5|, ULTIMATE.start_main_#t~mem11#1.base=|v_ULTIMATE.start_main_#t~mem11#1.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_3|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_3|, #memory_int=|v_#memory_int_1|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_3|}  AuxVars[]  AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][7], [threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 47#threadEXITtrue, 155#(= |#race~datas~0| 0), Black: 141#true, Black: 143#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 138#true, Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 21#L1016-4true, Black: 153#true, 708#(and (= ~datas~0.offset 0) (not (= |ULTIMATE.start_main_#t~mem11#1.base| |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 161#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 162#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 160#(= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 3 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 172#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 175#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 173#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 324#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 174#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 949#(and (= ~datas~0.offset 0) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem11#1.base|))), 170#true, 494#true, Black: 326#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 87#L1025-9true, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 158#true, Black: 325#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 327#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 712#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 722#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= threadThread1of2ForFork0_~i~0 0) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 475#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_main_~i~2#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 714#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 718#(and (= ~datas~0.offset 0) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| ~datas~0.base (store (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (forall ((v_ArrVal_635 (Array Int Int))) (= (select (select (store (store |#race| ~datas~0.base (store (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)) |threadThread1of2ForFork0_#t~nondet4|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (forall ((v_ArrVal_635 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| ~datas~0.base (store (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))))), Black: 720#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 716#(and (= ~datas~0.offset 0) (forall ((v_ArrVal_635 (Array Int Int))) (= (select (select (store (store |#race| ~datas~0.base (store (store (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))) |threadThread1of2ForFork0_#t~nondet4|)) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (forall ((v_ArrVal_635 (Array Int Int))) (= (select (select (store (store |#race| ~datas~0.base (store (store (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_635) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)) |threadThread1of2ForFork0_#t~nondet4|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 726#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 980#(and (= ~datas~0.offset 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base (store (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base (store (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_743) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)))) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 724#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= threadThread1of2ForFork0_~i~0 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 974#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 988#(and (= ~datas~0.offset 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1)))) (= |ULTIMATE.start_main_~i~2#1| 0) (forall ((v_ArrVal_748 (Array Int Int)) (v_ArrVal_750 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_748) |ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_750) ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 955#(and (= ~datas~0.offset 0) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 847#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= threadThread1of2ForFork0_~i~0 0)), Black: 992#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 963#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 985#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 486#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 485#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 990#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 487#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 969#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 982#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |ULTIMATE.start_main_~i~2#1| 0) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 978#(and (= ~datas~0.offset 0) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem14#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= (+ 2 |ULTIMATE.start_main_#t~mem14#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 959#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (<= 0 |ULTIMATE.start_main_~threads_total~0#1|) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= threadThread1of2ForFork0_~i~0 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 497#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset)))), 1028#(and (<= |ULTIMATE.start_main_#t~mem11#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 498#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset)))), Black: 499#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset))) (= (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread2of2ForFork0_#t~nondet4|)), Black: 496#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), 471#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|))])
[2023-10-25 14:57:28,627 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2023-10-25 14:57:28,627 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-10-25 14:57:28,627 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-10-25 14:57:28,627 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2023-10-25 14:57:35,461 INFO  L130       PetriNetUnfolder]: 19898/35074 cut-off events.
[2023-10-25 14:57:35,462 INFO  L131       PetriNetUnfolder]: For 518436/523055 co-relation queries the response was YES.
[2023-10-25 14:57:35,649 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 269498 conditions, 35074 events. 19898/35074 cut-off events. For 518436/523055 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 287010 event pairs, 2762 based on Foata normal form. 1341/35704 useless extension candidates. Maximal degree in co-relation 269440. Up to 12353 conditions per place. 
[2023-10-25 14:57:35,874 INFO  L137   encePairwiseOnDemand]: 206/217 looper letters, 1589 selfloop transitions, 137 changer transitions 23/1936 dead transitions.
[2023-10-25 14:57:35,874 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 1936 transitions, 32078 flow
[2023-10-25 14:57:35,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-10-25 14:57:35,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-10-25 14:57:35,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1056 transitions.
[2023-10-25 14:57:35,876 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5407066052227343
[2023-10-25 14:57:35,876 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1056 transitions.
[2023-10-25 14:57:35,876 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1056 transitions.
[2023-10-25 14:57:35,876 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:35,876 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1056 transitions.
[2023-10-25 14:57:35,886 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 117.33333333333333) internal successors, (1056), 9 states have internal predecessors, (1056), 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-25 14:57:35,888 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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-25 14:57:35,888 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 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-25 14:57:35,888 INFO  L175             Difference]: Start difference. First operand has 192 places, 1321 transitions, 19826 flow. Second operand 9 states and 1056 transitions.
[2023-10-25 14:57:35,888 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 1936 transitions, 32078 flow
[2023-10-25 14:57:43,354 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 1936 transitions, 30691 flow, removed 678 selfloop flow, removed 7 redundant places.
[2023-10-25 14:57:43,377 INFO  L231             Difference]: Finished difference. Result has 191 places, 1314 transitions, 18835 flow
[2023-10-25 14:57:43,378 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=18597, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18835, PETRI_PLACES=191, PETRI_TRANSITIONS=1314}
[2023-10-25 14:57:43,379 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 124 predicate places.
[2023-10-25 14:57:43,379 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 1314 transitions, 18835 flow
[2023-10-25 14:57:43,379 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 103.7) internal successors, (1037), 10 states have internal predecessors, (1037), 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-25 14:57:43,379 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:43,379 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]
[2023-10-25 14:57:43,385 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-25 14:57:43,583 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:43,584 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:57:43,585 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:43,585 INFO  L85        PathProgramCache]: Analyzing trace with hash -510957477, now seen corresponding path program 3 times
[2023-10-25 14:57:43,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:43,586 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60168626]
[2023-10-25 14:57:43,586 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:43,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:43,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:44,360 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-25 14:57:44,360 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:44,360 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60168626]
[2023-10-25 14:57:44,360 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60168626] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:44,360 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661772112]
[2023-10-25 14:57:44,360 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-25 14:57:44,360 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:44,360 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:44,361 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-25 14:57:44,410 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-25 14:57:44,620 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-25 14:57:44,621 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:57:44,622 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-10-25 14:57:44,625 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:44,634 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 18 treesize of output 16
[2023-10-25 14:57:44,868 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 14:57:44,869 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37
[2023-10-25 14:57:44,874 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:44,875 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 18 treesize of output 20
[2023-10-25 14:57:45,014 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 14 treesize of output 16
[2023-10-25 14:57:45,019 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 24 treesize of output 24
[2023-10-25 14:57:45,113 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3
[2023-10-25 14:57:45,117 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 13
[2023-10-25 14:57:45,186 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 14:57:45,233 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 28 treesize of output 27
[2023-10-25 14:57:45,293 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 14:57:45,367 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 14:57:45,436 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 54 treesize of output 50
[2023-10-25 14:57:45,452 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 54 treesize of output 50
[2023-10-25 14:57:45,496 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 54 treesize of output 50
[2023-10-25 14:57:45,588 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 54 treesize of output 50
[2023-10-25 14:57:45,641 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-25 14:57:45,642 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:45,673 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_974 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_974 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_974 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_974 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-10-25 14:57:45,717 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-10-25 14:57:45,757 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)))) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))))))) is different from false
[2023-10-25 14:57:45,778 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 2 .cse1)) (.cse3 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false
[2023-10-25 14:57:45,804 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset .cse2 1)) (.cse1 (+ c_~datas~0.offset 2 .cse2)) (.cse4 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_974 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_973) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) c_~datas~0.base) .cse4))))))) is different from false
[2023-10-25 14:57:45,822 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:45,822 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 54 treesize of output 70
[2023-10-25 14:57:45,832 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:45,832 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 151 treesize of output 71
[2023-10-25 14:57:45,835 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 55 treesize of output 41
[2023-10-25 14:57:45,838 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 27 treesize of output 20
[2023-10-25 14:57:45,868 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 14:57:45,869 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 53 treesize of output 1
[2023-10-25 14:57:45,874 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 14:57:45,874 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 54 treesize of output 1
[2023-10-25 14:57:45,879 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 14:57:45,880 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 54 treesize of output 1
[2023-10-25 14:57:46,006 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-25 14:57:46,007 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [661772112] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:46,007 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:46,007 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28
[2023-10-25 14:57:46,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97985817]
[2023-10-25 14:57:46,007 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:46,008 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2023-10-25 14:57:46,008 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:46,008 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2023-10-25 14:57:46,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=489, Unknown=8, NotChecked=250, Total=870
[2023-10-25 14:57:46,204 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2023-10-25 14:57:46,205 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 1314 transitions, 18835 flow. Second operand  has 30 states, 30 states have (on average 68.4) internal successors, (2052), 30 states have internal predecessors, (2052), 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-25 14:57:46,205 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:46,205 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2023-10-25 14:57:46,205 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:58:10,920 INFO  L130       PetriNetUnfolder]: 37758/62130 cut-off events.
[2023-10-25 14:58:10,920 INFO  L131       PetriNetUnfolder]: For 855992/856014 co-relation queries the response was YES.
[2023-10-25 14:58:11,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 487817 conditions, 62130 events. 37758/62130 cut-off events. For 855992/856014 co-relation queries the response was YES. Maximal size of possible extension queue 1819. Compared 496349 event pairs, 6662 based on Foata normal form. 134/62120 useless extension candidates. Maximal degree in co-relation 487760. Up to 21891 conditions per place. 
[2023-10-25 14:58:11,521 INFO  L137   encePairwiseOnDemand]: 183/217 looper letters, 2005 selfloop transitions, 899 changer transitions 50/2957 dead transitions.
[2023-10-25 14:58:11,521 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 2957 transitions, 47223 flow
[2023-10-25 14:58:11,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2023-10-25 14:58:11,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2023-10-25 14:58:11,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2627 transitions.
[2023-10-25 14:58:11,525 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.39051583172290766
[2023-10-25 14:58:11,525 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2627 transitions.
[2023-10-25 14:58:11,525 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2627 transitions.
[2023-10-25 14:58:11,525 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:58:11,526 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2627 transitions.
[2023-10-25 14:58:11,528 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 84.74193548387096) internal successors, (2627), 31 states have internal predecessors, (2627), 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-25 14:58:11,532 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 217.0) internal successors, (6944), 32 states have internal predecessors, (6944), 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-25 14:58:11,533 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 217.0) internal successors, (6944), 32 states have internal predecessors, (6944), 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-25 14:58:11,533 INFO  L175             Difference]: Start difference. First operand has 191 places, 1314 transitions, 18835 flow. Second operand 31 states and 2627 transitions.
[2023-10-25 14:58:11,533 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 2957 transitions, 47223 flow
[2023-10-25 14:58:31,739 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 2957 transitions, 46559 flow, removed 0 selfloop flow, removed 8 redundant places.
[2023-10-25 14:58:31,779 INFO  L231             Difference]: Finished difference. Result has 225 places, 1840 transitions, 29290 flow
[2023-10-25 14:58:31,780 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=18561, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=376, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=866, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=29290, PETRI_PLACES=225, PETRI_TRANSITIONS=1840}
[2023-10-25 14:58:31,780 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 158 predicate places.
[2023-10-25 14:58:31,805 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 1840 transitions, 29290 flow
[2023-10-25 14:58:31,806 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 68.4) internal successors, (2052), 30 states have internal predecessors, (2052), 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-25 14:58:31,806 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:58:31,806 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]
[2023-10-25 14:58:31,813 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-25 14:58:32,010 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:58:32,011 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2023-10-25 14:58:32,011 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:58:32,012 INFO  L85        PathProgramCache]: Analyzing trace with hash -692358967, now seen corresponding path program 4 times
[2023-10-25 14:58:32,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:58:32,012 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462899682]
[2023-10-25 14:58:32,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:32,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:58:32,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:58:32,765 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-25 14:58:32,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:58:32,765 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462899682]
[2023-10-25 14:58:32,765 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462899682] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:58:32,766 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520135225]
[2023-10-25 14:58:32,766 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-25 14:58:32,766 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:58:32,766 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:58:32,768 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-25 14:58:32,795 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-25 14:58:32,958 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-25 14:58:32,958 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:58:32,959 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-10-25 14:58:32,962 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:58:32,983 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 18 treesize of output 16
[2023-10-25 14:58:33,179 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 14:58:33,180 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37
[2023-10-25 14:58:33,184 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:33,185 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 18 treesize of output 20
[2023-10-25 14:58:33,331 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 24 treesize of output 24
[2023-10-25 14:58:33,345 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 14 treesize of output 16
[2023-10-25 14:58:33,446 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 14:58:33,501 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 28 treesize of output 27
[2023-10-25 14:58:33,595 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 13
[2023-10-25 14:58:33,604 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7
[2023-10-25 14:58:33,666 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 30 treesize of output 30
[2023-10-25 14:58:33,697 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 14:58:33,798 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 42 treesize of output 40
[2023-10-25 14:58:33,810 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 42 treesize of output 40
[2023-10-25 14:58:33,841 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 42 treesize of output 40
[2023-10-25 14:58:33,922 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 52 treesize of output 57
[2023-10-25 14:58:34,062 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 59 treesize of output 67
[2023-10-25 14:58:34,127 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-25 14:58:34,127 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:58:34,446 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse3 (+ c_~datas~0.offset 3 .cse4))) (and (forall ((v_ArrVal_1087 Int) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse2 c_~datas~0.base (store (select .cse2 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) (+ c_~datas~0.offset .cse4 1)))) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse6 c_~datas~0.base (store (select .cse6 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse8 c_~datas~0.base (store (select .cse8 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse10 c_~datas~0.base (store (select .cse10 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse9 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse4))))))) is different from false
[2023-10-25 14:58:34,525 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse10 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse5 (+ c_~datas~0.offset 2 .cse10))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse3 (+ c_~datas~0.offset 3 .cse10)) (.cse4 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1087 Int) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse2 c_~datas~0.base (store (select .cse2 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) .cse5))) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse7 c_~datas~0.base (store (select .cse7 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse9 c_~datas~0.base (store (select .cse9 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) (+ c_~datas~0.offset .cse10)))) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse11 (let ((.cse12 (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse12 c_~datas~0.base (store (select .cse12 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse11 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse11 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) (+ c_~datas~0.offset .cse10 1)))))))) is different from false
[2023-10-25 14:58:34,557 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse12 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse3 (+ c_~datas~0.offset 3 .cse12)) (.cse5 (+ c_~datas~0.offset 2 .cse12))) (and (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse2 (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse4 c_~datas~0.base (store (select .cse4 c_~datas~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse2 c_~datas~0.base (store (select .cse2 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (let ((.cse7 (store (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse8 c_~datas~0.base (store (select .cse8 c_~datas~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse7 c_~datas~0.base (store (select .cse7 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) .cse5))) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (let ((.cse10 (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse11 c_~datas~0.base (store (select .cse11 c_~datas~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse10 c_~datas~0.base (store (select .cse10 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse9 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) (+ c_~datas~0.offset .cse12)))) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= (select (select (let ((.cse13 (let ((.cse14 (store (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse15 c_~datas~0.base (store (select .cse15 c_~datas~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse14 c_~datas~0.base (store (select .cse14 c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse13 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse13 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1087))) c_~datas~0.base) (+ c_~datas~0.offset .cse12 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 14:58:34,664 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse10 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (.cse4 (+ c_~datas~0.offset 3 .cse10)) (.cse6 (+ c_~datas~0.offset 2 .cse10))) (and (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse3 (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse5 c_~datas~0.base (store (select .cse5 c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse3 c_~datas~0.base (store (select .cse3 c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1087))) c_~datas~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse9 c_~datas~0.base (store (select .cse9 c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse8 c_~datas~0.base (store (select .cse8 c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_1087))) c_~datas~0.base) (+ c_~datas~0.offset .cse10 1)))) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse11 (let ((.cse12 (store (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse13 c_~datas~0.base (store (select .cse13 c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse12 c_~datas~0.base (store (select .cse12 c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse11 .cse1 (store (select .cse11 .cse1) .cse2 v_ArrVal_1087))) c_~datas~0.base) .cse6))) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse14 (let ((.cse15 (store (let ((.cse16 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse16 c_~datas~0.base (store (select .cse16 c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse15 c_~datas~0.base (store (select .cse15 c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse14 .cse1 (store (select .cse14 .cse1) .cse2 v_ArrVal_1087))) c_~datas~0.base) (+ c_~datas~0.offset .cse10))))))) is different from false
[2023-10-25 14:58:34,743 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse18 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse14 (+ c_~datas~0.offset .cse18 1))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (.cse4 (+ c_~datas~0.offset 3 .cse18)) (.cse6 (+ c_~datas~0.offset 2 .cse18)) (.cse7 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse14 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (let ((.cse3 (store (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse5 c_~datas~0.base (store (select .cse5 c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse3 c_~datas~0.base (store (select .cse3 c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1087))) c_~datas~0.base) .cse4))) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= (select (select (let ((.cse8 (let ((.cse9 (store (let ((.cse10 (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse10 c_~datas~0.base (store (select .cse10 c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse9 c_~datas~0.base (store (select .cse9 c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 v_ArrVal_1087))) c_~datas~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= (select (select (let ((.cse11 (let ((.cse12 (store (let ((.cse13 (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse13 c_~datas~0.base (store (select .cse13 c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse12 c_~datas~0.base (store (select .cse12 c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse11 .cse1 (store (select .cse11 .cse1) .cse2 v_ArrVal_1087))) c_~datas~0.base) .cse14) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1087 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse15 (let ((.cse16 (store (let ((.cse17 (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1079))) (store .cse17 c_~datas~0.base (store (select .cse17 c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1084))) (store .cse16 c_~datas~0.base (store (select .cse16 c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))))) (store .cse15 .cse1 (store (select .cse15 .cse1) .cse2 v_ArrVal_1087))) c_~datas~0.base) (+ c_~datas~0.offset .cse18)))))))) is different from false
[2023-10-25 14:58:34,768 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:34,768 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 2 case distinctions, treesize of input 310 treesize of output 176
[2023-10-25 14:58:35,109 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:35,111 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 2193643 treesize of output 2055539
[2023-10-25 14:58:42,457 WARN  L233               SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 1798 DAG size of output: 1797 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 14:58:42,720 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 2276182 treesize of output 2195542
[2023-10-25 14:58:45,793 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 2329558 treesize of output 2131990
[2023-10-25 14:59:10,705 WARN  L233               SmtUtils]: Spent 18.71s on a formula simplification. DAG size of input: 907 DAG size of output: 907 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 14:59:46,947 WARN  L233               SmtUtils]: Spent 19.62s on a formula simplification. DAG size of input: 905 DAG size of output: 905 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:00:06,085 WARN  L233               SmtUtils]: Spent 15.49s on a formula simplification. DAG size of input: 903 DAG size of output: 903 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:00:46,317 WARN  L233               SmtUtils]: Spent 34.02s on a formula simplification. DAG size of input: 806 DAG size of output: 806 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:01:23,230 WARN  L233               SmtUtils]: Spent 33.86s on a formula simplification. DAG size of input: 804 DAG size of output: 804 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:01:42,053 WARN  L233               SmtUtils]: Spent 15.77s on a formula simplification. DAG size of input: 802 DAG size of output: 802 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:02:03,301 WARN  L233               SmtUtils]: Spent 15.21s on a formula simplification. DAG size of input: 663 DAG size of output: 663 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:02:31,407 WARN  L233               SmtUtils]: Spent 25.10s on a formula simplification. DAG size of input: 661 DAG size of output: 661 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:02:53,113 WARN  L233               SmtUtils]: Spent 15.56s on a formula simplification. DAG size of input: 655 DAG size of output: 655 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:03:08,043 WARN  L233               SmtUtils]: Spent 8.95s on a formula simplification. DAG size of input: 630 DAG size of output: 630 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:03:26,052 WARN  L233               SmtUtils]: Spent 14.97s on a formula simplification. DAG size of input: 629 DAG size of output: 629 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:03:52,949 WARN  L233               SmtUtils]: Spent 23.85s on a formula simplification. DAG size of input: 629 DAG size of output: 629 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:04:10,713 WARN  L233               SmtUtils]: Spent 14.79s on a formula simplification. DAG size of input: 629 DAG size of output: 629 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:04:28,651 WARN  L233               SmtUtils]: Spent 14.96s on a formula simplification. DAG size of input: 629 DAG size of output: 629 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:04:55,797 WARN  L233               SmtUtils]: Spent 24.16s on a formula simplification. DAG size of input: 629 DAG size of output: 629 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:05:26,367 WARN  L233               SmtUtils]: Spent 24.59s on a formula simplification. DAG size of input: 629 DAG size of output: 629 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:05:47,407 WARN  L233               SmtUtils]: Spent 14.87s on a formula simplification. DAG size of input: 629 DAG size of output: 629 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:06:22,244 WARN  L233               SmtUtils]: Spent 23.02s on a formula simplification. DAG size of input: 627 DAG size of output: 627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:06:47,472 WARN  L233               SmtUtils]: Spent 22.45s on a formula simplification. DAG size of input: 527 DAG size of output: 527 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:07:06,667 WARN  L233               SmtUtils]: Spent 13.74s on a formula simplification. DAG size of input: 501 DAG size of output: 501 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:07:31,514 WARN  L233               SmtUtils]: Spent 22.08s on a formula simplification. DAG size of input: 499 DAG size of output: 499 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:07:59,259 WARN  L233               SmtUtils]: Spent 22.18s on a formula simplification. DAG size of input: 494 DAG size of output: 494 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:08:21,508 WARN  L233               SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 490 DAG size of output: 490 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:08:40,822 WARN  L233               SmtUtils]: Spent 13.80s on a formula simplification. DAG size of input: 476 DAG size of output: 476 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:09:00,197 WARN  L233               SmtUtils]: Spent 13.85s on a formula simplification. DAG size of input: 474 DAG size of output: 474 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:09:08,491 WARN  L233               SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 472 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:09:33,604 WARN  L233               SmtUtils]: Spent 22.31s on a formula simplification. DAG size of input: 462 DAG size of output: 462 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:09:53,158 WARN  L233               SmtUtils]: Spent 13.95s on a formula simplification. DAG size of input: 450 DAG size of output: 450 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:10:04,190 WARN  L233               SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 448 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:10:18,013 WARN  L233               SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 448 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:10:34,916 WARN  L233               SmtUtils]: Spent 14.07s on a formula simplification. DAG size of input: 448 DAG size of output: 448 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2023-10-25 15:10:45,875 WARN  L233               SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 448 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
Killed by 15
