./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 b58f526b84c4770498ad28815e8f4d6b375e3a6fe83677be246862043bbd2c7f
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-02-28 17:20:54,743 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 17:20:54,744 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-02-28 17:20:54,764 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-02-28 17:20:54,765 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-02-28 17:20:54,765 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-02-28 17:20:54,766 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-02-28 17:20:54,767 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-02-28 17:20:54,768 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-02-28 17:20:54,769 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-02-28 17:20:54,769 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-02-28 17:20:54,770 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-02-28 17:20:54,770 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-02-28 17:20:54,771 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-02-28 17:20:54,772 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-02-28 17:20:54,773 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-02-28 17:20:54,773 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-02-28 17:20:54,774 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-02-28 17:20:54,775 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-02-28 17:20:54,776 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-02-28 17:20:54,777 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-02-28 17:20:54,778 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-02-28 17:20:54,779 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-02-28 17:20:54,779 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-02-28 17:20:54,781 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-02-28 17:20:54,782 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-02-28 17:20:54,782 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-02-28 17:20:54,782 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-02-28 17:20:54,783 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-02-28 17:20:54,783 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-02-28 17:20:54,783 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-02-28 17:20:54,784 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-02-28 17:20:54,784 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-02-28 17:20:54,785 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-02-28 17:20:54,786 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-02-28 17:20:54,786 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-02-28 17:20:54,786 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-02-28 17:20:54,786 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-02-28 17:20:54,786 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-02-28 17:20:54,787 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-02-28 17:20:54,787 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-02-28 17:20:54,788 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 17:20:54,808 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-02-28 17:20:54,808 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 17:20:54,809 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 17:20:54,809 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 17:20:54,809 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 17:20:54,809 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 17:20:54,810 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 17:20:54,810 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 17:20:54,810 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-02-28 17:20:54,810 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 17:20:54,810 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-02-28 17:20:54,810 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-02-28 17:20:54,810 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 17:20:54,811 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 17:20:54,811 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 17:20:54,811 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 17:20:54,811 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 17:20:54,811 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 17:20:54,811 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 17:20:54,811 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-02-28 17:20:54,811 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 17:20:54,811 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-02-28 17:20:54,812 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 17:20:54,812 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 17:20:54,812 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 17:20:54,812 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 17:20:54,812 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:20:54,812 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 17:20:54,812 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 17:20:54,812 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-02-28 17:20:54,813 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 17:20:54,813 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 17:20:54,813 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 17:20:54,813 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 17:20:54,813 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 17:20:54,813 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 17:20:54,813 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-02-28 17:20:54,813 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 -> b58f526b84c4770498ad28815e8f4d6b375e3a6fe83677be246862043bbd2c7f
[2024-02-28 17:20:55,335 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 17:20:55,620 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 17:20:55,623 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 17:20:55,624 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-02-28 17:20:55,625 INFO  L275        PluginConnector]: CDTParser initialized
[2024-02-28 17:20:55,626 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index.i
[2024-02-28 17:20:57,057 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 17:20:57,244 INFO  L351              CDTParser]: Found 1 translation units.
[2024-02-28 17:20:57,244 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index.i
[2024-02-28 17:20:57,255 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/381abac50/644819bc91ff4ffda5cb81902a4d90f7/FLAG407f4f3d5
[2024-02-28 17:20:57,266 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/381abac50/644819bc91ff4ffda5cb81902a4d90f7
[2024-02-28 17:20:57,267 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 17:20:57,269 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 17:20:57,269 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 17:20:57,270 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 17:20:57,273 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 17:20:57,273 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,274 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74882b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57, skipping insertion in model container
[2024-02-28 17:20:57,274 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,280 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-02-28 17:20:57,313 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-02-28 17:20:57,426 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:20:57,556 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:20:57,562 INFO  L203         MainTranslator]: Completed pre-run
[2024-02-28 17:20:57,572 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:20:57,593 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:20:57,628 INFO  L208         MainTranslator]: Completed translation
[2024-02-28 17:20:57,628 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57 WrapperNode
[2024-02-28 17:20:57,628 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 17:20:57,629 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 17:20:57,629 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 17:20:57,629 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 17:20:57,635 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,649 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,666 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2024-02-28 17:20:57,666 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 17:20:57,667 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 17:20:57,667 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 17:20:57,667 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 17:20:57,674 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,674 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,677 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,678 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,684 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,686 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,688 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,689 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,691 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 17:20:57,691 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 17:20:57,691 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 17:20:57,692 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-02-28 17:20:57,692 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (1/1) ...
[2024-02-28 17:20:57,697 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:20:57,703 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:20:57,715 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)
[2024-02-28 17:20:57,722 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
[2024-02-28 17:20:57,761 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 17:20:57,761 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 17:20:57,761 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 17:20:57,761 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 17:20:57,761 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 17:20:57,761 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 17:20:57,761 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 17:20:57,761 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 17:20:57,761 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 17:20:57,762 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 17:20:57,762 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 17:20:57,763 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-02-28 17:20:57,909 INFO  L235             CfgBuilder]: Building ICFG
[2024-02-28 17:20:57,910 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 17:20:58,106 INFO  L276             CfgBuilder]: Performing block encoding
[2024-02-28 17:20:58,113 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 17:20:58,113 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 17:20:58,114 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:20:58 BoogieIcfgContainer
[2024-02-28 17:20:58,115 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 17:20:58,116 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 17:20:58,116 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 17:20:58,119 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-02-28 17:20:58,119 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 05:20:57" (1/3) ...
[2024-02-28 17:20:58,119 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59461f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:20:58, skipping insertion in model container
[2024-02-28 17:20:58,119 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:20:57" (2/3) ...
[2024-02-28 17:20:58,120 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59461f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:20:58, skipping insertion in model container
[2024-02-28 17:20:58,120 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:20:58" (3/3) ...
[2024-02-28 17:20:58,121 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index.i
[2024-02-28 17:20:58,127 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 17:20:58,135 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 17:20:58,135 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-02-28 17:20:58,135 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 17:20:58,178 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 17:20:58,207 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2024-02-28 17:20:58,258 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2024-02-28 17:20:58,258 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:20:58,262 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. 
[2024-02-28 17:20:58,262 INFO  L82        GeneralOperation]: Start removeDead. Operand has 114 places, 115 transitions, 238 flow
[2024-02-28 17:20:58,266 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 114 places, 115 transitions, 238 flow
[2024-02-28 17:20:58,270 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:20:58,278 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 115 transitions, 238 flow
[2024-02-28 17:20:58,280 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 115 transitions, 238 flow
[2024-02-28 17:20:58,280 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 238 flow
[2024-02-28 17:20:58,306 INFO  L130       PetriNetUnfolder]: 6/165 cut-off events.
[2024-02-28 17:20:58,306 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:20:58,307 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. 
[2024-02-28 17:20:58,308 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2052
[2024-02-28 17:21:00,835 INFO  L134        LiptonReduction]: Checked pairs total: 12265
[2024-02-28 17:21:00,835 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2024-02-28 17:21:00,848 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:21:00,853 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;@6997175d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:21:00,853 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-02-28 17:21:00,854 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-02-28 17:21:00,855 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:21:00,855 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:00,855 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-02-28 17:21:00,855 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)] ===
[2024-02-28 17:21:00,859 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:00,859 INFO  L85        PathProgramCache]: Analyzing trace with hash 381, now seen corresponding path program 1 times
[2024-02-28 17:21:00,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:00,867 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537724973]
[2024-02-28 17:21:00,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:00,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:01,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:01,099 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:01,100 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:01,100 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537724973]
[2024-02-28 17:21:01,100 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537724973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:01,100 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:01,100 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-02-28 17:21:01,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180357136]
[2024-02-28 17:21:01,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:01,123 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-02-28 17:21:01,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:01,163 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-02-28 17:21:01,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-02-28 17:21:01,167 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193
[2024-02-28 17:21:01,170 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)
[2024-02-28 17:21:01,170 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:01,170 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193
[2024-02-28 17:21:01,171 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:01,227 INFO  L130       PetriNetUnfolder]: 33/213 cut-off events.
[2024-02-28 17:21:01,227 INFO  L131       PetriNetUnfolder]: For 4/7 co-relation queries the response was YES.
[2024-02-28 17:21:01,228 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. 
[2024-02-28 17:21:01,229 INFO  L137   encePairwiseOnDemand]: 192/193 looper letters, 16 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2024-02-28 17:21:01,230 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 138 flow
[2024-02-28 17:21:01,231 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-02-28 17:21:01,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-02-28 17:21:01,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions.
[2024-02-28 17:21:01,242 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6139896373056994
[2024-02-28 17:21:01,243 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 237 transitions.
[2024-02-28 17:21:01,244 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions.
[2024-02-28 17:21:01,245 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:01,259 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions.
[2024-02-28 17:21:01,264 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)
[2024-02-28 17:21:01,270 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)
[2024-02-28 17:21:01,270 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)
[2024-02-28 17:21:01,272 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 237 transitions.
[2024-02-28 17:21:01,274 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 138 flow
[2024-02-28 17:21:01,276 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:01,278 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2024-02-28 17:21:01,279 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}
[2024-02-28 17:21:01,282 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2024-02-28 17:21:01,282 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2024-02-28 17:21:01,282 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)
[2024-02-28 17:21:01,282 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:01,282 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:01,282 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 17:21:01,283 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)] ===
[2024-02-28 17:21:01,283 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:01,283 INFO  L85        PathProgramCache]: Analyzing trace with hash -835068003, now seen corresponding path program 1 times
[2024-02-28 17:21:01,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:01,283 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430886751]
[2024-02-28 17:21:01,284 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:01,284 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:01,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:01,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:01,582 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:01,582 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430886751]
[2024-02-28 17:21:01,582 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430886751] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:01,583 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:01,583 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:21:01,583 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757125258]
[2024-02-28 17:21:01,583 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:01,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:21:01,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:01,584 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:21:01,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:21:01,777 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2024-02-28 17:21:01,778 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)
[2024-02-28 17:21:01,778 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:01,778 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2024-02-28 17:21:01,778 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:01,944 INFO  L130       PetriNetUnfolder]: 245/703 cut-off events.
[2024-02-28 17:21:01,944 INFO  L131       PetriNetUnfolder]: For 7/9 co-relation queries the response was YES.
[2024-02-28 17:21:01,946 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. 
[2024-02-28 17:21:01,948 INFO  L137   encePairwiseOnDemand]: 170/193 looper letters, 61 selfloop transitions, 29 changer transitions 0/102 dead transitions.
[2024-02-28 17:21:01,948 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 395 flow
[2024-02-28 17:21:01,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:21:01,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:21:01,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 603 transitions.
[2024-02-28 17:21:01,952 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5207253886010362
[2024-02-28 17:21:01,952 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 603 transitions.
[2024-02-28 17:21:01,952 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 603 transitions.
[2024-02-28 17:21:01,953 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:01,953 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 603 transitions.
[2024-02-28 17:21:01,955 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)
[2024-02-28 17:21:01,958 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)
[2024-02-28 17:21:01,959 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)
[2024-02-28 17:21:01,959 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 603 transitions.
[2024-02-28 17:21:01,959 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 395 flow
[2024-02-28 17:21:01,960 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:01,961 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2024-02-28 17:21:01,961 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}
[2024-02-28 17:21:01,962 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2024-02-28 17:21:01,962 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2024-02-28 17:21:01,962 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)
[2024-02-28 17:21:01,963 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:01,963 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:01,963 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 17:21:01,963 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)] ===
[2024-02-28 17:21:01,963 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:01,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 1573274442, now seen corresponding path program 1 times
[2024-02-28 17:21:01,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:01,964 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198605602]
[2024-02-28 17:21:01,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:01,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:01,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:01,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:01,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:01,989 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198605602]
[2024-02-28 17:21:01,990 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198605602] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:01,990 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:01,990 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:21:01,990 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534468660]
[2024-02-28 17:21:01,990 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:01,990 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:21:01,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:01,991 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:21:01,991 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:21:02,000 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 193
[2024-02-28 17:21:02,000 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)
[2024-02-28 17:21:02,000 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:02,000 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 193
[2024-02-28 17:21:02,000 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:02,067 INFO  L130       PetriNetUnfolder]: 122/485 cut-off events.
[2024-02-28 17:21:02,067 INFO  L131       PetriNetUnfolder]: For 111/116 co-relation queries the response was YES.
[2024-02-28 17:21:02,069 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. 
[2024-02-28 17:21:02,070 INFO  L137   encePairwiseOnDemand]: 189/193 looper letters, 24 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2024-02-28 17:21:02,070 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 392 flow
[2024-02-28 17:21:02,070 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:21:02,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:21:02,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions.
[2024-02-28 17:21:02,072 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5785837651122625
[2024-02-28 17:21:02,072 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 335 transitions.
[2024-02-28 17:21:02,072 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions.
[2024-02-28 17:21:02,072 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:02,072 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions.
[2024-02-28 17:21:02,073 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)
[2024-02-28 17:21:02,074 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)
[2024-02-28 17:21:02,074 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)
[2024-02-28 17:21:02,075 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 335 transitions.
[2024-02-28 17:21:02,075 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 392 flow
[2024-02-28 17:21:02,078 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:02,079 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2024-02-28 17:21:02,079 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}
[2024-02-28 17:21:02,080 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2024-02-28 17:21:02,080 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2024-02-28 17:21:02,080 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)
[2024-02-28 17:21:02,080 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:02,080 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:02,080 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 17:21:02,081 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)] ===
[2024-02-28 17:21:02,081 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:02,081 INFO  L85        PathProgramCache]: Analyzing trace with hash 348753171, now seen corresponding path program 1 times
[2024-02-28 17:21:02,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:02,081 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922211943]
[2024-02-28 17:21:02,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:02,082 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:02,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:02,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:02,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:02,258 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922211943]
[2024-02-28 17:21:02,258 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922211943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:02,258 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:02,258 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:21:02,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025862306]
[2024-02-28 17:21:02,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:02,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:21:02,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:02,259 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:21:02,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:21:02,412 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 193
[2024-02-28 17:21:02,413 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)
[2024-02-28 17:21:02,413 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:02,413 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 193
[2024-02-28 17:21:02,414 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:02,554 INFO  L130       PetriNetUnfolder]: 228/682 cut-off events.
[2024-02-28 17:21:02,554 INFO  L131       PetriNetUnfolder]: For 296/304 co-relation queries the response was YES.
[2024-02-28 17:21:02,556 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. 
[2024-02-28 17:21:02,560 INFO  L137   encePairwiseOnDemand]: 182/193 looper letters, 52 selfloop transitions, 33 changer transitions 8/128 dead transitions.
[2024-02-28 17:21:02,560 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 128 transitions, 725 flow
[2024-02-28 17:21:02,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:21:02,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:21:02,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions.
[2024-02-28 17:21:02,562 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5483592400690847
[2024-02-28 17:21:02,562 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 635 transitions.
[2024-02-28 17:21:02,562 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions.
[2024-02-28 17:21:02,563 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:02,566 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions.
[2024-02-28 17:21:02,567 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)
[2024-02-28 17:21:02,569 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)
[2024-02-28 17:21:02,569 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)
[2024-02-28 17:21:02,569 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 635 transitions.
[2024-02-28 17:21:02,570 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 128 transitions, 725 flow
[2024-02-28 17:21:02,575 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:02,577 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2024-02-28 17:21:02,577 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}
[2024-02-28 17:21:02,578 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2024-02-28 17:21:02,578 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2024-02-28 17:21:02,578 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)
[2024-02-28 17:21:02,579 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:02,579 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:02,579 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 17:21:02,579 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:21:02,580 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:02,580 INFO  L85        PathProgramCache]: Analyzing trace with hash -1543790880, now seen corresponding path program 1 times
[2024-02-28 17:21:02,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:02,581 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281406906]
[2024-02-28 17:21:02,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:02,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:02,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:02,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:02,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:02,822 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281406906]
[2024-02-28 17:21:02,822 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281406906] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:02,822 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:02,822 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:21:02,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380230504]
[2024-02-28 17:21:02,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:02,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:21:02,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:02,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:21:02,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:21:02,940 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 193
[2024-02-28 17:21:02,940 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)
[2024-02-28 17:21:02,940 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:02,940 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 193
[2024-02-28 17:21:02,941 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:03,231 INFO  L130       PetriNetUnfolder]: 402/1014 cut-off events.
[2024-02-28 17:21:03,231 INFO  L131       PetriNetUnfolder]: For 761/769 co-relation queries the response was YES.
[2024-02-28 17:21:03,233 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. 
[2024-02-28 17:21:03,237 INFO  L137   encePairwiseOnDemand]: 171/193 looper letters, 105 selfloop transitions, 76 changer transitions 24/218 dead transitions.
[2024-02-28 17:21:03,237 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 218 transitions, 1523 flow
[2024-02-28 17:21:03,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:21:03,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:21:03,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions.
[2024-02-28 17:21:03,239 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5474956822107081
[2024-02-28 17:21:03,239 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 634 transitions.
[2024-02-28 17:21:03,239 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions.
[2024-02-28 17:21:03,240 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:03,240 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions.
[2024-02-28 17:21:03,241 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)
[2024-02-28 17:21:03,243 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)
[2024-02-28 17:21:03,243 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)
[2024-02-28 17:21:03,243 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 634 transitions.
[2024-02-28 17:21:03,243 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 218 transitions, 1523 flow
[2024-02-28 17:21:03,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 218 transitions, 1523 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:03,250 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2024-02-28 17:21:03,250 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}
[2024-02-28 17:21:03,250 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2024-02-28 17:21:03,251 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2024-02-28 17:21:03,251 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)
[2024-02-28 17:21:03,251 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:03,251 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-02-28 17:21:03,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 17:21:03,251 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)] ===
[2024-02-28 17:21:03,252 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:03,252 INFO  L85        PathProgramCache]: Analyzing trace with hash -1557923308, now seen corresponding path program 1 times
[2024-02-28 17:21:03,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:03,252 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350247912]
[2024-02-28 17:21:03,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:03,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:03,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:21:03,273 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 17:21:03,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 17:21:03,299 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 17:21:03,299 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 17:21:03,301 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-02-28 17:21:03,302 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-02-28 17:21:03,302 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-02-28 17:21:03,303 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-02-28 17:21:03,303 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-02-28 17:21:03,303 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-02-28 17:21:03,303 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-02-28 17:21:03,303 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-02-28 17:21:03,303 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-02-28 17:21:03,303 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-02-28 17:21:03,303 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-02-28 17:21:03,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 17:21:03,304 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:03,306 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 17:21:03,306 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 17:21:03,323 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 17:21:03,325 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2024-02-28 17:21:03,343 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2024-02-28 17:21:03,344 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 17:21:03,344 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. 
[2024-02-28 17:21:03,344 INFO  L82        GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 288 flow
[2024-02-28 17:21:03,345 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 135 places, 135 transitions, 288 flow
[2024-02-28 17:21:03,345 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:21:03,345 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 135 transitions, 288 flow
[2024-02-28 17:21:03,345 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 135 transitions, 288 flow
[2024-02-28 17:21:03,346 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow
[2024-02-28 17:21:03,362 INFO  L130       PetriNetUnfolder]: 11/289 cut-off events.
[2024-02-28 17:21:03,362 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-02-28 17:21:03,362 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. 
[2024-02-28 17:21:03,365 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5220
[2024-02-28 17:21:05,510 INFO  L134        LiptonReduction]: Checked pairs total: 30411
[2024-02-28 17:21:05,510 INFO  L136        LiptonReduction]: Total number of compositions: 82
[2024-02-28 17:21:05,511 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:21:05,512 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;@6997175d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:21:05,512 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2024-02-28 17:21:05,513 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2024-02-28 17:21:05,513 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:21:05,513 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:05,513 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-02-28 17:21:05,513 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)] ===
[2024-02-28 17:21:05,514 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:05,514 INFO  L85        PathProgramCache]: Analyzing trace with hash 617, now seen corresponding path program 1 times
[2024-02-28 17:21:05,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:05,514 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012855224]
[2024-02-28 17:21:05,514 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:05,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:05,517 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:05,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:05,518 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:05,518 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012855224]
[2024-02-28 17:21:05,518 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012855224] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:05,518 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:05,518 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-02-28 17:21:05,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580798792]
[2024-02-28 17:21:05,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:05,518 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-02-28 17:21:05,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:05,519 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-02-28 17:21:05,519 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-02-28 17:21:05,519 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 217
[2024-02-28 17:21:05,519 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)
[2024-02-28 17:21:05,519 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:05,519 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 217
[2024-02-28 17:21:05,519 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:05,631 INFO  L130       PetriNetUnfolder]: 411/1257 cut-off events.
[2024-02-28 17:21:05,631 INFO  L131       PetriNetUnfolder]: For 71/158 co-relation queries the response was YES.
[2024-02-28 17:21:05,633 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. 
[2024-02-28 17:21:05,636 INFO  L137   encePairwiseOnDemand]: 216/217 looper letters, 22 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2024-02-28 17:21:05,636 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 188 flow
[2024-02-28 17:21:05,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-02-28 17:21:05,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-02-28 17:21:05,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions.
[2024-02-28 17:21:05,637 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6428571428571429
[2024-02-28 17:21:05,637 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 279 transitions.
[2024-02-28 17:21:05,637 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 279 transitions.
[2024-02-28 17:21:05,638 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:05,638 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 279 transitions.
[2024-02-28 17:21:05,638 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)
[2024-02-28 17:21:05,639 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)
[2024-02-28 17:21:05,639 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)
[2024-02-28 17:21:05,639 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 279 transitions.
[2024-02-28 17:21:05,639 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 188 flow
[2024-02-28 17:21:05,639 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:05,640 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2024-02-28 17:21:05,640 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}
[2024-02-28 17:21:05,641 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2024-02-28 17:21:05,641 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2024-02-28 17:21:05,641 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)
[2024-02-28 17:21:05,641 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:05,641 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:05,641 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 17:21:05,641 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)] ===
[2024-02-28 17:21:05,642 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:05,642 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578260816, now seen corresponding path program 1 times
[2024-02-28 17:21:05,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:05,642 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553432166]
[2024-02-28 17:21:05,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:05,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:05,650 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:05,754 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:05,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:05,755 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553432166]
[2024-02-28 17:21:05,755 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553432166] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:05,755 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:05,755 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:21:05,755 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009871687]
[2024-02-28 17:21:05,755 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:05,755 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:21:05,755 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:05,755 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:21:05,756 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:21:05,971 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217
[2024-02-28 17:21:05,971 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)
[2024-02-28 17:21:05,971 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:05,972 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217
[2024-02-28 17:21:05,972 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:06,772 INFO  L130       PetriNetUnfolder]: 5742/10965 cut-off events.
[2024-02-28 17:21:06,773 INFO  L131       PetriNetUnfolder]: For 239/274 co-relation queries the response was YES.
[2024-02-28 17:21:06,780 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. 
[2024-02-28 17:21:06,813 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 93 selfloop transitions, 48 changer transitions 0/158 dead transitions.
[2024-02-28 17:21:06,813 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 158 transitions, 627 flow
[2024-02-28 17:21:06,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:21:06,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:21:06,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions.
[2024-02-28 17:21:06,815 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5668202764976958
[2024-02-28 17:21:06,816 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 738 transitions.
[2024-02-28 17:21:06,816 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions.
[2024-02-28 17:21:06,816 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:06,816 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions.
[2024-02-28 17:21:06,818 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)
[2024-02-28 17:21:06,819 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)
[2024-02-28 17:21:06,820 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)
[2024-02-28 17:21:06,820 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 738 transitions.
[2024-02-28 17:21:06,820 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 158 transitions, 627 flow
[2024-02-28 17:21:06,821 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 158 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:06,822 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2024-02-28 17:21:06,823 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}
[2024-02-28 17:21:06,823 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2024-02-28 17:21:06,823 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2024-02-28 17:21:06,823 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)
[2024-02-28 17:21:06,823 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:06,823 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:06,824 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 17:21:06,824 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)] ===
[2024-02-28 17:21:06,824 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:06,824 INFO  L85        PathProgramCache]: Analyzing trace with hash 933296301, now seen corresponding path program 1 times
[2024-02-28 17:21:06,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:06,824 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284675731]
[2024-02-28 17:21:06,824 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:06,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:06,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:06,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:06,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:06,841 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284675731]
[2024-02-28 17:21:06,841 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284675731] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:06,841 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:06,841 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 17:21:06,841 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605626440]
[2024-02-28 17:21:06,841 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:06,841 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 17:21:06,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:06,842 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 17:21:06,842 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 17:21:06,853 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2024-02-28 17:21:06,853 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)
[2024-02-28 17:21:06,853 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:06,853 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2024-02-28 17:21:06,853 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:07,256 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)])
[2024-02-28 17:21:07,256 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-02-28 17:21:07,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:21:07,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:21:07,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:21:07,256 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)])
[2024-02-28 17:21:07,257 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-02-28 17:21:07,257 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:21:07,257 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:21:07,257 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-02-28 17:21:07,364 INFO  L130       PetriNetUnfolder]: 2751/6463 cut-off events.
[2024-02-28 17:21:07,364 INFO  L131       PetriNetUnfolder]: For 1904/2456 co-relation queries the response was YES.
[2024-02-28 17:21:07,375 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. 
[2024-02-28 17:21:07,393 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2024-02-28 17:21:07,393 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2024-02-28 17:21:07,394 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 17:21:07,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 17:21:07,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions.
[2024-02-28 17:21:07,395 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5990783410138248
[2024-02-28 17:21:07,395 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 390 transitions.
[2024-02-28 17:21:07,395 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions.
[2024-02-28 17:21:07,396 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:07,396 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions.
[2024-02-28 17:21:07,397 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)
[2024-02-28 17:21:07,398 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)
[2024-02-28 17:21:07,398 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)
[2024-02-28 17:21:07,398 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 390 transitions.
[2024-02-28 17:21:07,398 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2024-02-28 17:21:07,408 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:07,409 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2024-02-28 17:21:07,409 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}
[2024-02-28 17:21:07,410 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2024-02-28 17:21:07,410 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2024-02-28 17:21:07,410 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)
[2024-02-28 17:21:07,410 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:07,410 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:07,410 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 17:21:07,411 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)] ===
[2024-02-28 17:21:07,411 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:07,411 INFO  L85        PathProgramCache]: Analyzing trace with hash -2101318696, now seen corresponding path program 1 times
[2024-02-28 17:21:07,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:07,411 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007942144]
[2024-02-28 17:21:07,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:07,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:07,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:07,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:07,594 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:07,594 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007942144]
[2024-02-28 17:21:07,594 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007942144] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:07,594 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:07,594 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:21:07,594 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066020163]
[2024-02-28 17:21:07,594 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:07,594 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:21:07,595 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:07,595 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:21:07,595 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:21:07,792 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2024-02-28 17:21:07,792 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)
[2024-02-28 17:21:07,792 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:07,792 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2024-02-28 17:21:07,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:08,871 INFO  L130       PetriNetUnfolder]: 5675/10752 cut-off events.
[2024-02-28 17:21:08,871 INFO  L131       PetriNetUnfolder]: For 6509/6607 co-relation queries the response was YES.
[2024-02-28 17:21:08,887 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. 
[2024-02-28 17:21:08,915 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 110 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2024-02-28 17:21:08,916 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1313 flow
[2024-02-28 17:21:08,916 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:21:08,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:21:08,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions.
[2024-02-28 17:21:08,919 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5821812596006144
[2024-02-28 17:21:08,919 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 758 transitions.
[2024-02-28 17:21:08,919 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 758 transitions.
[2024-02-28 17:21:08,920 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:08,920 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 758 transitions.
[2024-02-28 17:21:08,922 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)
[2024-02-28 17:21:08,924 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)
[2024-02-28 17:21:08,924 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)
[2024-02-28 17:21:08,924 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 758 transitions.
[2024-02-28 17:21:08,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1313 flow
[2024-02-28 17:21:08,934 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1313 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:08,936 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2024-02-28 17:21:08,936 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}
[2024-02-28 17:21:08,937 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2024-02-28 17:21:08,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2024-02-28 17:21:08,938 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)
[2024-02-28 17:21:08,938 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:08,938 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:08,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 17:21:08,938 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:21:08,938 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:08,938 INFO  L85        PathProgramCache]: Analyzing trace with hash 1490734773, now seen corresponding path program 1 times
[2024-02-28 17:21:08,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:08,939 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119557818]
[2024-02-28 17:21:08,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:08,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:08,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:09,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:09,131 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:09,131 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119557818]
[2024-02-28 17:21:09,131 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119557818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:09,132 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:09,132 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:21:09,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572980799]
[2024-02-28 17:21:09,132 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:09,132 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:21:09,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:09,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:21:09,133 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:21:09,290 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2024-02-28 17:21:09,291 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)
[2024-02-28 17:21:09,291 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:09,291 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2024-02-28 17:21:09,291 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:11,313 INFO  L130       PetriNetUnfolder]: 11355/20109 cut-off events.
[2024-02-28 17:21:11,314 INFO  L131       PetriNetUnfolder]: For 18604/18765 co-relation queries the response was YES.
[2024-02-28 17:21:11,352 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. 
[2024-02-28 17:21:11,411 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 239 selfloop transitions, 132 changer transitions 0/389 dead transitions.
[2024-02-28 17:21:11,412 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 389 transitions, 2939 flow
[2024-02-28 17:21:11,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:21:11,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:21:11,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2024-02-28 17:21:11,414 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2024-02-28 17:21:11,414 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2024-02-28 17:21:11,414 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2024-02-28 17:21:11,415 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:11,415 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2024-02-28 17:21:11,416 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)
[2024-02-28 17:21:11,418 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)
[2024-02-28 17:21:11,418 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)
[2024-02-28 17:21:11,418 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 778 transitions.
[2024-02-28 17:21:11,418 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 389 transitions, 2939 flow
[2024-02-28 17:21:11,446 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 389 transitions, 2939 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:11,450 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2024-02-28 17:21:11,450 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}
[2024-02-28 17:21:11,451 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2024-02-28 17:21:11,451 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2024-02-28 17:21:11,451 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)
[2024-02-28 17:21:11,451 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:11,451 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:11,451 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 17:21:11,451 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)] ===
[2024-02-28 17:21:11,452 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:11,452 INFO  L85        PathProgramCache]: Analyzing trace with hash -686777030, now seen corresponding path program 1 times
[2024-02-28 17:21:11,452 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:11,452 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707328996]
[2024-02-28 17:21:11,452 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:11,452 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:11,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:11,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 17:21:11,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:11,705 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707328996]
[2024-02-28 17:21:11,705 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707328996] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:21:11,705 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869016646]
[2024-02-28 17:21:11,705 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:11,705 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:21:11,705 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:21:11,706 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)
[2024-02-28 17:21:11,719 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
[2024-02-28 17:21:11,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:11,854 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2024-02-28 17:21:11,857 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:21:11,973 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
[2024-02-28 17:21:11,997 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:11,998 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
[2024-02-28 17:21:12,028 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:12,029 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:12,030 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
[2024-02-28 17:21:12,068 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:12,069 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:12,070 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:12,071 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
[2024-02-28 17:21:12,115 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:12,116 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
[2024-02-28 17:21:12,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 17:21:12,138 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:21:12,256 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
[2024-02-28 17:21:12,275 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
[2024-02-28 17:21:12,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2024-02-28 17:21:12,323 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869016646] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:21:12,323 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:21:12,323 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15
[2024-02-28 17:21:12,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576306310]
[2024-02-28 17:21:12,324 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:21:12,324 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-02-28 17:21:12,324 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:12,324 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-02-28 17:21:12,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=8, NotChecked=54, Total=272
[2024-02-28 17:21:12,331 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 217
[2024-02-28 17:21:12,332 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)
[2024-02-28 17:21:12,332 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:12,332 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 217
[2024-02-28 17:21:12,333 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:15,277 INFO  L130       PetriNetUnfolder]: 14603/24245 cut-off events.
[2024-02-28 17:21:15,278 INFO  L131       PetriNetUnfolder]: For 41050/41050 co-relation queries the response was YES.
[2024-02-28 17:21:15,329 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. 
[2024-02-28 17:21:15,406 INFO  L137   encePairwiseOnDemand]: 207/217 looper letters, 500 selfloop transitions, 54 changer transitions 1/562 dead transitions.
[2024-02-28 17:21:15,406 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 562 transitions, 5374 flow
[2024-02-28 17:21:15,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:21:15,406 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:21:15,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 699 transitions.
[2024-02-28 17:21:15,408 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46017116524028967
[2024-02-28 17:21:15,408 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 699 transitions.
[2024-02-28 17:21:15,408 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 699 transitions.
[2024-02-28 17:21:15,408 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:15,408 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 699 transitions.
[2024-02-28 17:21:15,410 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)
[2024-02-28 17:21:15,411 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)
[2024-02-28 17:21:15,411 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)
[2024-02-28 17:21:15,412 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 699 transitions.
[2024-02-28 17:21:15,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 562 transitions, 5374 flow
[2024-02-28 17:21:15,622 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 562 transitions, 5278 flow, removed 48 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:15,627 INFO  L231             Difference]: Finished difference. Result has 102 places, 314 transitions, 2506 flow
[2024-02-28 17:21:15,627 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}
[2024-02-28 17:21:15,627 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 35 predicate places.
[2024-02-28 17:21:15,627 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 314 transitions, 2506 flow
[2024-02-28 17:21:15,628 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)
[2024-02-28 17:21:15,628 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:15,628 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:21:15,640 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-02-28 17:21:15,829 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
[2024-02-28 17:21:15,830 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:21:15,830 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:15,831 INFO  L85        PathProgramCache]: Analyzing trace with hash -1154275821, now seen corresponding path program 1 times
[2024-02-28 17:21:15,831 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:15,831 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045338912]
[2024-02-28 17:21:15,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:15,831 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:15,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:16,065 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:21:16,065 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:16,065 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045338912]
[2024-02-28 17:21:16,065 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045338912] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:16,065 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:16,065 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-02-28 17:21:16,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325589146]
[2024-02-28 17:21:16,065 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:16,066 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 17:21:16,066 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:16,066 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 17:21:16,066 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-02-28 17:21:16,276 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217
[2024-02-28 17:21:16,277 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)
[2024-02-28 17:21:16,277 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:16,277 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217
[2024-02-28 17:21:16,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:19,359 INFO  L130       PetriNetUnfolder]: 13820/24388 cut-off events.
[2024-02-28 17:21:19,359 INFO  L131       PetriNetUnfolder]: For 46821/46988 co-relation queries the response was YES.
[2024-02-28 17:21:19,415 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. 
[2024-02-28 17:21:19,496 INFO  L137   encePairwiseOnDemand]: 201/217 looper letters, 462 selfloop transitions, 166 changer transitions 2/647 dead transitions.
[2024-02-28 17:21:19,496 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 647 transitions, 6020 flow
[2024-02-28 17:21:19,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-02-28 17:21:19,497 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-02-28 17:21:19,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 973 transitions.
[2024-02-28 17:21:19,499 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5604838709677419
[2024-02-28 17:21:19,499 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 973 transitions.
[2024-02-28 17:21:19,499 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 973 transitions.
[2024-02-28 17:21:19,500 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:19,500 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 973 transitions.
[2024-02-28 17:21:19,502 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)
[2024-02-28 17:21:19,503 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)
[2024-02-28 17:21:19,504 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)
[2024-02-28 17:21:19,504 INFO  L175             Difference]: Start difference. First operand has 102 places, 314 transitions, 2506 flow. Second operand 8 states and 973 transitions.
[2024-02-28 17:21:19,504 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 647 transitions, 6020 flow
[2024-02-28 17:21:19,659 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 647 transitions, 5921 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-02-28 17:21:19,665 INFO  L231             Difference]: Finished difference. Result has 111 places, 430 transitions, 4113 flow
[2024-02-28 17:21:19,665 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}
[2024-02-28 17:21:19,666 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 44 predicate places.
[2024-02-28 17:21:19,666 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 430 transitions, 4113 flow
[2024-02-28 17:21:19,666 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)
[2024-02-28 17:21:19,666 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:19,666 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]
[2024-02-28 17:21:19,666 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-02-28 17:21:19,667 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)] ===
[2024-02-28 17:21:19,667 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:19,667 INFO  L85        PathProgramCache]: Analyzing trace with hash 340394548, now seen corresponding path program 1 times
[2024-02-28 17:21:19,667 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:19,667 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008553287]
[2024-02-28 17:21:19,667 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:19,667 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:19,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:19,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:19,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:19,718 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008553287]
[2024-02-28 17:21:19,718 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008553287] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:21:19,718 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620635580]
[2024-02-28 17:21:19,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:19,718 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:21:19,718 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:21:19,719 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)
[2024-02-28 17:21:19,729 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
[2024-02-28 17:21:19,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:19,818 INFO  L263         TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-28 17:21:19,819 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:21:19,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:19,854 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:21:19,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:19,887 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [620635580] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:21:19,887 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:21:19,887 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2024-02-28 17:21:19,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973367958]
[2024-02-28 17:21:19,887 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:21:19,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-02-28 17:21:19,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:19,888 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-02-28 17:21:19,888 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-02-28 17:21:19,993 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 217
[2024-02-28 17:21:19,994 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)
[2024-02-28 17:21:19,994 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:19,994 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 217
[2024-02-28 17:21:19,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:21,680 INFO  L130       PetriNetUnfolder]: 5754/12879 cut-off events.
[2024-02-28 17:21:21,680 INFO  L131       PetriNetUnfolder]: For 42791/44813 co-relation queries the response was YES.
[2024-02-28 17:21:21,714 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. 
[2024-02-28 17:21:21,752 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 152 selfloop transitions, 5 changer transitions 23/483 dead transitions.
[2024-02-28 17:21:21,753 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 483 transitions, 4821 flow
[2024-02-28 17:21:21,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:21:21,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:21:21,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions.
[2024-02-28 17:21:21,755 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5766951942067149
[2024-02-28 17:21:21,755 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 876 transitions.
[2024-02-28 17:21:21,755 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions.
[2024-02-28 17:21:21,756 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:21,756 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions.
[2024-02-28 17:21:21,758 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)
[2024-02-28 17:21:21,759 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)
[2024-02-28 17:21:21,760 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)
[2024-02-28 17:21:21,760 INFO  L175             Difference]: Start difference. First operand has 111 places, 430 transitions, 4113 flow. Second operand 7 states and 876 transitions.
[2024-02-28 17:21:21,760 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 483 transitions, 4821 flow
[2024-02-28 17:21:21,877 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 483 transitions, 4807 flow, removed 7 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:21,882 INFO  L231             Difference]: Finished difference. Result has 120 places, 390 transitions, 3685 flow
[2024-02-28 17:21:21,882 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}
[2024-02-28 17:21:21,883 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 53 predicate places.
[2024-02-28 17:21:21,883 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 390 transitions, 3685 flow
[2024-02-28 17:21:21,883 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)
[2024-02-28 17:21:21,883 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:21,883 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]
[2024-02-28 17:21:21,891 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-02-28 17:21:22,084 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
[2024-02-28 17:21:22,085 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)] ===
[2024-02-28 17:21:22,085 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:22,085 INFO  L85        PathProgramCache]: Analyzing trace with hash -2108254852, now seen corresponding path program 1 times
[2024-02-28 17:21:22,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:22,086 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74624493]
[2024-02-28 17:21:22,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:22,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:22,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:22,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:21:22,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:22,310 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74624493]
[2024-02-28 17:21:22,310 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74624493] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:22,310 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:22,310 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-02-28 17:21:22,310 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356437839]
[2024-02-28 17:21:22,310 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:22,311 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-02-28 17:21:22,311 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:22,311 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-02-28 17:21:22,311 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-02-28 17:21:22,705 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2024-02-28 17:21:22,705 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)
[2024-02-28 17:21:22,705 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:22,706 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2024-02-28 17:21:22,706 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:24,777 INFO  L130       PetriNetUnfolder]: 8771/16346 cut-off events.
[2024-02-28 17:21:24,777 INFO  L131       PetriNetUnfolder]: For 65738/66133 co-relation queries the response was YES.
[2024-02-28 17:21:24,820 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. 
[2024-02-28 17:21:24,876 INFO  L137   encePairwiseOnDemand]: 209/217 looper letters, 343 selfloop transitions, 13 changer transitions 7/402 dead transitions.
[2024-02-28 17:21:24,877 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 402 transitions, 4497 flow
[2024-02-28 17:21:24,877 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 17:21:24,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 17:21:24,879 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions.
[2024-02-28 17:21:24,879 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48847926267281105
[2024-02-28 17:21:24,879 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 742 transitions.
[2024-02-28 17:21:24,879 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 742 transitions.
[2024-02-28 17:21:24,879 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:24,879 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 742 transitions.
[2024-02-28 17:21:24,881 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)
[2024-02-28 17:21:24,882 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)
[2024-02-28 17:21:24,882 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)
[2024-02-28 17:21:24,882 INFO  L175             Difference]: Start difference. First operand has 120 places, 390 transitions, 3685 flow. Second operand 7 states and 742 transitions.
[2024-02-28 17:21:24,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 402 transitions, 4497 flow
[2024-02-28 17:21:25,029 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 402 transitions, 4408 flow, removed 6 selfloop flow, removed 3 redundant places.
[2024-02-28 17:21:25,034 INFO  L231             Difference]: Finished difference. Result has 122 places, 388 transitions, 3635 flow
[2024-02-28 17:21:25,034 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}
[2024-02-28 17:21:25,035 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 55 predicate places.
[2024-02-28 17:21:25,035 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 388 transitions, 3635 flow
[2024-02-28 17:21:25,035 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)
[2024-02-28 17:21:25,035 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:25,036 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]
[2024-02-28 17:21:25,036 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-02-28 17:21:25,036 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:21:25,036 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:25,036 INFO  L85        PathProgramCache]: Analyzing trace with hash 860099489, now seen corresponding path program 1 times
[2024-02-28 17:21:25,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:25,036 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083431048]
[2024-02-28 17:21:25,036 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:25,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:25,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:25,220 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-02-28 17:21:25,221 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:25,221 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083431048]
[2024-02-28 17:21:25,221 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083431048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:21:25,221 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:21:25,221 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:21:25,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090516351]
[2024-02-28 17:21:25,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:21:25,221 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:21:25,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:25,222 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:21:25,222 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:21:25,387 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217
[2024-02-28 17:21:25,388 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)
[2024-02-28 17:21:25,388 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:25,388 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217
[2024-02-28 17:21:25,388 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:28,789 INFO  L130       PetriNetUnfolder]: 12785/22892 cut-off events.
[2024-02-28 17:21:28,790 INFO  L131       PetriNetUnfolder]: For 82124/82522 co-relation queries the response was YES.
[2024-02-28 17:21:28,871 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. 
[2024-02-28 17:21:28,951 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 405 selfloop transitions, 156 changer transitions 18/594 dead transitions.
[2024-02-28 17:21:28,951 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 594 transitions, 6405 flow
[2024-02-28 17:21:28,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:21:28,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:21:28,953 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions.
[2024-02-28 17:21:28,953 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5975422427035331
[2024-02-28 17:21:28,953 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 778 transitions.
[2024-02-28 17:21:28,953 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions.
[2024-02-28 17:21:28,953 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:28,953 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions.
[2024-02-28 17:21:28,955 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)
[2024-02-28 17:21:28,956 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)
[2024-02-28 17:21:28,956 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)
[2024-02-28 17:21:28,956 INFO  L175             Difference]: Start difference. First operand has 122 places, 388 transitions, 3635 flow. Second operand 6 states and 778 transitions.
[2024-02-28 17:21:28,956 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 594 transitions, 6405 flow
[2024-02-28 17:21:29,212 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 594 transitions, 6347 flow, removed 1 selfloop flow, removed 3 redundant places.
[2024-02-28 17:21:29,219 INFO  L231             Difference]: Finished difference. Result has 128 places, 501 transitions, 5166 flow
[2024-02-28 17:21:29,219 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}
[2024-02-28 17:21:29,219 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 61 predicate places.
[2024-02-28 17:21:29,220 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 501 transitions, 5166 flow
[2024-02-28 17:21:29,220 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)
[2024-02-28 17:21:29,220 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:29,220 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]
[2024-02-28 17:21:29,220 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-02-28 17:21:29,220 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:21:29,220 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:29,221 INFO  L85        PathProgramCache]: Analyzing trace with hash -907237555, now seen corresponding path program 1 times
[2024-02-28 17:21:29,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:29,221 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158380853]
[2024-02-28 17:21:29,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:29,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:29,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:29,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:29,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:29,700 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158380853]
[2024-02-28 17:21:29,700 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158380853] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:21:29,700 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561856055]
[2024-02-28 17:21:29,700 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:29,700 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:21:29,700 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:21:29,701 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)
[2024-02-28 17:21:29,722 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
[2024-02-28 17:21:29,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:29,859 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 61 conjunts are in the unsatisfiable core
[2024-02-28 17:21:29,862 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:21:29,888 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-02-28 17:21:29,889 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
[2024-02-28 17:21:30,049 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:21:30,049 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
[2024-02-28 17:21:30,058 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
[2024-02-28 17:21:30,241 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
[2024-02-28 17:21:30,252 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
[2024-02-28 17:21:30,267 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
[2024-02-28 17:21:30,275 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
[2024-02-28 17:21:30,328 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
[2024-02-28 17:21:30,361 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
[2024-02-28 17:21:30,404 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
[2024-02-28 17:21:30,456 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
[2024-02-28 17:21:30,532 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
[2024-02-28 17:21:30,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:30,569 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:21:30,593 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
[2024-02-28 17:21:30,634 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
[2024-02-28 17:21:30,654 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
[2024-02-28 17:21:30,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:30,921 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561856055] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:21:30,921 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:21:30,921 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28
[2024-02-28 17:21:30,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125882910]
[2024-02-28 17:21:30,922 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:21:30,923 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-02-28 17:21:30,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:30,923 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-02-28 17:21:30,924 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=563, Unknown=13, NotChecked=156, Total=870
[2024-02-28 17:21:31,014 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 217
[2024-02-28 17:21:31,016 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)
[2024-02-28 17:21:31,016 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:31,016 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 217
[2024-02-28 17:21:31,016 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:39,498 INFO  L130       PetriNetUnfolder]: 22932/37829 cut-off events.
[2024-02-28 17:21:39,499 INFO  L131       PetriNetUnfolder]: For 169052/169052 co-relation queries the response was YES.
[2024-02-28 17:21:39,662 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. 
[2024-02-28 17:21:39,802 INFO  L137   encePairwiseOnDemand]: 182/217 looper letters, 1158 selfloop transitions, 421 changer transitions 48/1630 dead transitions.
[2024-02-28 17:21:39,802 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 1630 transitions, 19732 flow
[2024-02-28 17:21:39,803 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-02-28 17:21:39,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-02-28 17:21:39,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1621 transitions.
[2024-02-28 17:21:39,806 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35571648014044327
[2024-02-28 17:21:39,806 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1621 transitions.
[2024-02-28 17:21:39,806 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1621 transitions.
[2024-02-28 17:21:39,807 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:39,807 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1621 transitions.
[2024-02-28 17:21:39,810 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)
[2024-02-28 17:21:39,813 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)
[2024-02-28 17:21:39,814 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)
[2024-02-28 17:21:39,814 INFO  L175             Difference]: Start difference. First operand has 128 places, 501 transitions, 5166 flow. Second operand 21 states and 1621 transitions.
[2024-02-28 17:21:39,814 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 1630 transitions, 19732 flow
[2024-02-28 17:21:40,752 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 1630 transitions, 19410 flow, removed 161 selfloop flow, removed 0 redundant places.
[2024-02-28 17:21:40,766 INFO  L231             Difference]: Finished difference. Result has 158 places, 888 transitions, 11320 flow
[2024-02-28 17:21:40,767 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}
[2024-02-28 17:21:40,767 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 91 predicate places.
[2024-02-28 17:21:40,767 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 888 transitions, 11320 flow
[2024-02-28 17:21:40,768 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)
[2024-02-28 17:21:40,768 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:21:40,768 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]
[2024-02-28 17:21:40,774 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
[2024-02-28 17:21:40,972 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
[2024-02-28 17:21:40,972 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:21:40,973 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:21:40,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -103982335, now seen corresponding path program 2 times
[2024-02-28 17:21:40,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:21:40,974 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505988291]
[2024-02-28 17:21:40,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:21:40,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:21:40,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:21:41,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:41,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:21:41,456 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505988291]
[2024-02-28 17:21:41,456 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505988291] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:21:41,456 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972819590]
[2024-02-28 17:21:41,456 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 17:21:41,456 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:21:41,456 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:21:41,457 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)
[2024-02-28 17:21:41,458 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
[2024-02-28 17:21:41,580 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 17:21:41,580 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:21:41,582 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 69 conjunts are in the unsatisfiable core
[2024-02-28 17:21:41,585 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:21:41,607 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
[2024-02-28 17:21:41,817 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:21:41,817 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37
[2024-02-28 17:21:41,822 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:21:41,822 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
[2024-02-28 17:21:41,958 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
[2024-02-28 17:21:41,973 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
[2024-02-28 17:21:42,002 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
[2024-02-28 17:21:42,068 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
[2024-02-28 17:21:42,139 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
[2024-02-28 17:21:42,383 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
[2024-02-28 17:21:42,391 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
[2024-02-28 17:21:42,438 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
[2024-02-28 17:21:42,469 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
[2024-02-28 17:21:42,533 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
[2024-02-28 17:21:42,558 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
[2024-02-28 17:21:42,592 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
[2024-02-28 17:21:42,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 54 treesize of output 50
[2024-02-28 17:21:42,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:21:42,733 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:21:42,755 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
[2024-02-28 17:21:42,795 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
[2024-02-28 17:21:42,838 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
[2024-02-28 17:21:42,860 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
[2024-02-28 17:21:42,889 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
[2024-02-28 17:21:42,917 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
[2024-02-28 17:21:43,293 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:21:43,293 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
[2024-02-28 17:21:43,302 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:21:43,303 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
[2024-02-28 17:21:43,312 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
[2024-02-28 17:21:43,317 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
[2024-02-28 17:21:43,324 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 122
[2024-02-28 17:21:43,461 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:21:43,462 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
[2024-02-28 17:21:43,473 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:21:43,473 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
[2024-02-28 17:21:43,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 17:21:43,699 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972819590] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:21:43,700 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:21:43,700 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 33
[2024-02-28 17:21:43,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563589715]
[2024-02-28 17:21:43,700 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:21:43,700 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-02-28 17:21:43,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:21:43,701 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-02-28 17:21:43,701 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=645, Unknown=19, NotChecked=354, Total=1190
[2024-02-28 17:21:43,758 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 217
[2024-02-28 17:21:43,761 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)
[2024-02-28 17:21:43,761 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:21:43,761 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 217
[2024-02-28 17:21:43,761 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:21:58,708 INFO  L130       PetriNetUnfolder]: 25870/42603 cut-off events.
[2024-02-28 17:21:58,708 INFO  L131       PetriNetUnfolder]: For 375098/375100 co-relation queries the response was YES.
[2024-02-28 17:21:58,913 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. 
[2024-02-28 17:21:59,082 INFO  L137   encePairwiseOnDemand]: 186/217 looper letters, 1243 selfloop transitions, 765 changer transitions 59/2070 dead transitions.
[2024-02-28 17:21:59,082 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 2070 transitions, 29101 flow
[2024-02-28 17:21:59,082 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-02-28 17:21:59,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-02-28 17:21:59,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2297 transitions.
[2024-02-28 17:21:59,086 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3414597889103612
[2024-02-28 17:21:59,086 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2297 transitions.
[2024-02-28 17:21:59,086 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2297 transitions.
[2024-02-28 17:21:59,087 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:21:59,087 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2297 transitions.
[2024-02-28 17:21:59,090 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)
[2024-02-28 17:21:59,096 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)
[2024-02-28 17:21:59,096 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)
[2024-02-28 17:21:59,096 INFO  L175             Difference]: Start difference. First operand has 158 places, 888 transitions, 11320 flow. Second operand 31 states and 2297 transitions.
[2024-02-28 17:21:59,096 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 2070 transitions, 29101 flow
[2024-02-28 17:22:03,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 2070 transitions, 28607 flow, removed 232 selfloop flow, removed 7 redundant places.
[2024-02-28 17:22:03,675 INFO  L231             Difference]: Finished difference. Result has 192 places, 1321 transitions, 19826 flow
[2024-02-28 17:22:03,675 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}
[2024-02-28 17:22:03,676 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 125 predicate places.
[2024-02-28 17:22:03,676 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 1321 transitions, 19826 flow
[2024-02-28 17:22:03,677 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)
[2024-02-28 17:22:03,677 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:22:03,677 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]
[2024-02-28 17:22:03,684 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
[2024-02-28 17:22:03,877 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
[2024-02-28 17:22:03,878 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)] ===
[2024-02-28 17:22:03,878 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:22:03,878 INFO  L85        PathProgramCache]: Analyzing trace with hash 1590730138, now seen corresponding path program 1 times
[2024-02-28 17:22:03,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:22:03,879 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854808185]
[2024-02-28 17:22:03,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:22:03,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:22:03,899 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:22:04,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:22:04,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:22:04,209 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854808185]
[2024-02-28 17:22:04,209 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854808185] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:22:04,209 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826612048]
[2024-02-28 17:22:04,209 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:22:04,209 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:22:04,209 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:22:04,210 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)
[2024-02-28 17:22:04,211 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
[2024-02-28 17:22:04,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:22:04,337 INFO  L263         TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 28 conjunts are in the unsatisfiable core
[2024-02-28 17:22:04,342 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:22:04,357 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:22:04,359 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
[2024-02-28 17:22:04,450 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:22:04,451 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
[2024-02-28 17:22:04,477 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:22:04,477 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
[2024-02-28 17:22:04,506 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
[2024-02-28 17:22:04,522 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
[2024-02-28 17:22:04,531 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
[2024-02-28 17:22:04,545 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:22:04,545 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
[2024-02-28 17:22:04,557 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
[2024-02-28 17:22:04,572 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:22:04,572 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
[2024-02-28 17:22:04,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:22:04,583 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 17:22:04,583 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826612048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:22:04,583 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 17:22:04,583 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 12
[2024-02-28 17:22:04,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647854052]
[2024-02-28 17:22:04,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:22:04,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 17:22:04,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:22:04,584 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 17:22:04,584 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182
[2024-02-28 17:22:05,326 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 217
[2024-02-28 17:22:05,327 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)
[2024-02-28 17:22:05,327 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:22:05,327 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 217
[2024-02-28 17:22:05,327 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:22:07,919 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|))])
[2024-02-28 17:22:07,920 INFO  L383   tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event
[2024-02-28 17:22:07,920 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-02-28 17:22:07,920 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-02-28 17:22:07,920 INFO  L386   tUnfolder$Statistics]:   existing Event has 37 ancestors and is cut-off event
[2024-02-28 17:22:08,922 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|))])
[2024-02-28 17:22:08,923 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-02-28 17:22:08,923 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-02-28 17:22:08,923 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-02-28 17:22:08,923 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-02-28 17:22:08,923 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|))])
[2024-02-28 17:22:08,924 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-02-28 17:22:08,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-02-28 17:22:08,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-02-28 17:22:08,924 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-02-28 17:22:14,729 INFO  L130       PetriNetUnfolder]: 19898/35074 cut-off events.
[2024-02-28 17:22:14,729 INFO  L131       PetriNetUnfolder]: For 518436/523055 co-relation queries the response was YES.
[2024-02-28 17:22:14,996 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. 
[2024-02-28 17:22:15,163 INFO  L137   encePairwiseOnDemand]: 206/217 looper letters, 1589 selfloop transitions, 137 changer transitions 23/1936 dead transitions.
[2024-02-28 17:22:15,164 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 1936 transitions, 32078 flow
[2024-02-28 17:22:15,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-02-28 17:22:15,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-02-28 17:22:15,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1056 transitions.
[2024-02-28 17:22:15,167 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5407066052227343
[2024-02-28 17:22:15,167 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1056 transitions.
[2024-02-28 17:22:15,167 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1056 transitions.
[2024-02-28 17:22:15,168 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:22:15,168 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1056 transitions.
[2024-02-28 17:22:15,170 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)
[2024-02-28 17:22:15,171 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)
[2024-02-28 17:22:15,171 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)
[2024-02-28 17:22:15,171 INFO  L175             Difference]: Start difference. First operand has 192 places, 1321 transitions, 19826 flow. Second operand 9 states and 1056 transitions.
[2024-02-28 17:22:15,171 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 1936 transitions, 32078 flow
[2024-02-28 17:22:19,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 1936 transitions, 30691 flow, removed 678 selfloop flow, removed 7 redundant places.
[2024-02-28 17:22:19,520 INFO  L231             Difference]: Finished difference. Result has 191 places, 1314 transitions, 18835 flow
[2024-02-28 17:22:19,521 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}
[2024-02-28 17:22:19,521 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 124 predicate places.
[2024-02-28 17:22:19,522 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 1314 transitions, 18835 flow
[2024-02-28 17:22:19,522 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)
[2024-02-28 17:22:19,522 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:22:19,522 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]
[2024-02-28 17:22:19,528 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-02-28 17:22:19,722 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
[2024-02-28 17:22:19,723 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:22:19,724 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:22:19,724 INFO  L85        PathProgramCache]: Analyzing trace with hash -510957477, now seen corresponding path program 3 times
[2024-02-28 17:22:19,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:22:19,724 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45103504]
[2024-02-28 17:22:19,724 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:22:19,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:22:19,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:22:20,161 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:22:20,162 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:22:20,162 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45103504]
[2024-02-28 17:22:20,162 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45103504] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:22:20,162 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893312509]
[2024-02-28 17:22:20,162 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 17:22:20,162 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:22:20,162 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:22:20,163 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)
[2024-02-28 17:22:20,164 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
[2024-02-28 17:22:20,360 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 17:22:20,360 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:22:20,361 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core
[2024-02-28 17:22:20,367 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:22:20,383 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
[2024-02-28 17:22:20,569 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:22:20,569 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
[2024-02-28 17:22:20,578 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:22:20,579 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
[2024-02-28 17:22:20,685 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
[2024-02-28 17:22:20,691 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
[2024-02-28 17:22:20,748 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
[2024-02-28 17:22:20,752 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
[2024-02-28 17:22:20,796 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
[2024-02-28 17:22:20,842 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
[2024-02-28 17:22:20,887 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
[2024-02-28 17:22:20,938 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
[2024-02-28 17:22:20,999 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
[2024-02-28 17:22:21,012 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
[2024-02-28 17:22:21,056 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
[2024-02-28 17:22:21,128 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
[2024-02-28 17:22:21,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:22:21,166 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:22:21,186 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
[2024-02-28 17:22:21,222 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
[2024-02-28 17:22:21,262 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
[2024-02-28 17:22:21,281 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
[2024-02-28 17:22:21,299 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
[2024-02-28 17:22:21,317 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:22:21,317 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
[2024-02-28 17:22:21,325 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:22:21,325 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
[2024-02-28 17:22:21,330 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41
[2024-02-28 17:22:21,334 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
[2024-02-28 17:22:21,353 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 17:22:21,354 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
[2024-02-28 17:22:21,360 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 17:22:21,361 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
[2024-02-28 17:22:21,367 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 17:22:21,367 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
[2024-02-28 17:22:21,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:22:21,490 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [893312509] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:22:21,491 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:22:21,491 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28
[2024-02-28 17:22:21,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266696614]
[2024-02-28 17:22:21,491 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:22:21,491 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-02-28 17:22:21,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:22:21,491 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-02-28 17:22:21,492 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=489, Unknown=8, NotChecked=250, Total=870
[2024-02-28 17:22:21,680 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 217
[2024-02-28 17:22:21,681 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)
[2024-02-28 17:22:21,681 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:22:21,681 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 217
[2024-02-28 17:22:21,681 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:22:45,346 INFO  L130       PetriNetUnfolder]: 37758/62130 cut-off events.
[2024-02-28 17:22:45,346 INFO  L131       PetriNetUnfolder]: For 855992/856014 co-relation queries the response was YES.
[2024-02-28 17:22:45,788 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. 
[2024-02-28 17:22:46,064 INFO  L137   encePairwiseOnDemand]: 183/217 looper letters, 2005 selfloop transitions, 899 changer transitions 50/2957 dead transitions.
[2024-02-28 17:22:46,064 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 2957 transitions, 47223 flow
[2024-02-28 17:22:46,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-02-28 17:22:46,065 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-02-28 17:22:46,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2627 transitions.
[2024-02-28 17:22:46,067 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.39051583172290766
[2024-02-28 17:22:46,067 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2627 transitions.
[2024-02-28 17:22:46,067 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2627 transitions.
[2024-02-28 17:22:46,068 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:22:46,068 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2627 transitions.
[2024-02-28 17:22:46,070 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)
[2024-02-28 17:22:46,074 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)
[2024-02-28 17:22:46,075 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)
[2024-02-28 17:22:46,075 INFO  L175             Difference]: Start difference. First operand has 191 places, 1314 transitions, 18835 flow. Second operand 31 states and 2627 transitions.
[2024-02-28 17:22:46,075 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 2957 transitions, 47223 flow
[2024-02-28 17:22:58,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 2957 transitions, 46559 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-02-28 17:22:58,209 INFO  L231             Difference]: Finished difference. Result has 225 places, 1840 transitions, 29290 flow
[2024-02-28 17:22:58,210 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}
[2024-02-28 17:22:58,224 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 158 predicate places.
[2024-02-28 17:22:58,225 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 1840 transitions, 29290 flow
[2024-02-28 17:22:58,226 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)
[2024-02-28 17:22:58,226 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:22:58,226 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]
[2024-02-28 17:22:58,400 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-02-28 17:22:58,426 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
[2024-02-28 17:22:58,427 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-02-28 17:22:58,427 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:22:58,428 INFO  L85        PathProgramCache]: Analyzing trace with hash -692358967, now seen corresponding path program 4 times
[2024-02-28 17:22:58,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:22:58,428 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092663692]
[2024-02-28 17:22:58,428 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:22:58,429 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:22:58,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:22:58,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:22:58,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:22:58,912 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092663692]
[2024-02-28 17:22:58,913 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092663692] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:22:58,913 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601823406]
[2024-02-28 17:22:58,913 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 17:22:58,913 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:22:58,913 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:22:58,914 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)
[2024-02-28 17:22:58,920 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
[2024-02-28 17:22:59,140 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 17:22:59,140 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:22:59,142 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core
[2024-02-28 17:22:59,148 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:22:59,160 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
[2024-02-28 17:22:59,346 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-02-28 17:22:59,346 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
[2024-02-28 17:22:59,351 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:22:59,352 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
[2024-02-28 17:22:59,482 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
[2024-02-28 17:22:59,497 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
[2024-02-28 17:22:59,591 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
[2024-02-28 17:22:59,656 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
[2024-02-28 17:22:59,740 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
[2024-02-28 17:22:59,755 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
[2024-02-28 17:22:59,809 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
[2024-02-28 17:22:59,833 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
[2024-02-28 17:22:59,908 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
[2024-02-28 17:22:59,925 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
[2024-02-28 17:22:59,955 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
[2024-02-28 17:23:00,013 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
[2024-02-28 17:23:00,109 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
[2024-02-28 17:23:00,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:23:00,158 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:23:00,454 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
[2024-02-28 17:23:00,524 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
[2024-02-28 17:23:00,569 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
[2024-02-28 17:23:00,645 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
[2024-02-28 17:23:00,709 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
[2024-02-28 17:23:00,737 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:23:00,737 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
[2024-02-28 17:23:00,918 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:23:00,923 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
[2024-02-28 17:23:07,829 WARN  L233               SmtUtils]: Spent 6.90s 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)
[2024-02-28 17:23:08,008 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
[2024-02-28 17:23:10,982 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
[2024-02-28 17:23:38,752 WARN  L233               SmtUtils]: Spent 20.67s 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)
[2024-02-28 17:24:18,709 WARN  L233               SmtUtils]: Spent 21.94s 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)
[2024-02-28 17:24:40,377 WARN  L233               SmtUtils]: Spent 17.58s 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)
[2024-02-28 17:25:25,042 WARN  L233               SmtUtils]: Spent 37.76s 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)
[2024-02-28 17:26:06,533 WARN  L233               SmtUtils]: Spent 38.09s 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)
[2024-02-28 17:26:27,360 WARN  L233               SmtUtils]: Spent 17.36s 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)
[2024-02-28 17:26:51,220 WARN  L233               SmtUtils]: Spent 17.06s 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)
[2024-02-28 17:27:21,883 WARN  L233               SmtUtils]: Spent 27.28s 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)
[2024-02-28 17:27:45,981 WARN  L233               SmtUtils]: Spent 17.30s 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)
[2024-02-28 17:28:02,565 WARN  L233               SmtUtils]: Spent 9.85s 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)
[2024-02-28 17:28:22,511 WARN  L233               SmtUtils]: Spent 16.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)
[2024-02-28 17:28:52,635 WARN  L233               SmtUtils]: Spent 26.68s 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)
[2024-02-28 17:29:12,763 WARN  L233               SmtUtils]: Spent 16.77s 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)
[2024-02-28 17:29:32,958 WARN  L233               SmtUtils]: Spent 16.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)
[2024-02-28 17:30:03,476 WARN  L233               SmtUtils]: Spent 27.11s 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)
[2024-02-28 17:30:37,662 WARN  L233               SmtUtils]: Spent 27.51s 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)
[2024-02-28 17:31:01,217 WARN  L233               SmtUtils]: Spent 16.78s 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)
[2024-02-28 17:31:40,422 WARN  L233               SmtUtils]: Spent 26.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)
[2024-02-28 17:32:08,600 WARN  L233               SmtUtils]: Spent 25.09s 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)
[2024-02-28 17:32:30,383 WARN  L233               SmtUtils]: Spent 15.60s 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)
[2024-02-28 17:32:58,392 WARN  L233               SmtUtils]: Spent 24.93s 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)
[2024-02-28 17:33:29,245 WARN  L233               SmtUtils]: Spent 24.75s 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)
[2024-02-28 17:33:53,886 WARN  L233               SmtUtils]: Spent 15.49s 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)
[2024-02-28 17:34:15,519 WARN  L233               SmtUtils]: Spent 15.52s 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)
[2024-02-28 17:34:37,077 WARN  L233               SmtUtils]: Spent 15.49s 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)
[2024-02-28 17:34:46,353 WARN  L233               SmtUtils]: Spent 6.19s 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)
Killed by 15
