./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-struct-race.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --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 3f4d1033cc80461b2e37f8849427907937a08432fe41ab4a97273e1b98e1dc1f
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-02-28 20:48:04,227 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 20:48:04,263 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 20:48:04,266 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-02-28 20:48:04,266 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-02-28 20:48:04,285 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 20:48:04,285 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 20:48:04,286 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 20:48:04,286 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 20:48:04,287 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 20:48:04,287 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 20:48:04,288 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 20:48:04,288 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-02-28 20:48:04,288 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 20:48:04,289 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 20:48:04,289 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-02-28 20:48:04,289 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 20:48:04,290 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 20:48:04,290 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 20:48:04,290 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 20:48:04,290 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 20:48:04,291 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 20:48:04,291 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 20:48:04,291 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-02-28 20:48:04,292 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-02-28 20:48:04,292 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 20:48:04,292 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-02-28 20:48:04,292 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 20:48:04,293 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 20:48:04,293 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 20:48:04,293 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 20:48:04,293 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 20:48:04,294 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 20:48:04,294 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-02-28 20:48:04,294 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 20:48:04,294 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 20:48:04,295 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-02-28 20:48:04,295 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 20:48:04,295 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 20:48:04,295 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 20:48:04,295 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 20:48:04,296 INFO  L153        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-pldi24/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-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> 3f4d1033cc80461b2e37f8849427907937a08432fe41ab4a97273e1b98e1dc1f
[2024-02-28 20:48:04,468 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 20:48:04,485 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 20:48:04,487 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 20:48:04,488 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-02-28 20:48:04,489 INFO  L274        PluginConnector]: CDTParser initialized
[2024-02-28 20:48:04,490 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2024-02-28 20:48:05,562 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 20:48:05,761 INFO  L384              CDTParser]: Found 1 translation units.
[2024-02-28 20:48:05,761 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2024-02-28 20:48:05,773 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/a8a93e573/0d116acb121e4e51aa272e24fa7af27a/FLAGf76a9c37a
[2024-02-28 20:48:05,783 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/a8a93e573/0d116acb121e4e51aa272e24fa7af27a
[2024-02-28 20:48:05,785 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 20:48:05,786 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 20:48:05,786 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 20:48:05,787 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 20:48:05,790 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 20:48:05,791 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 08:48:05" (1/1) ...
[2024-02-28 20:48:05,791 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a4db0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:05, skipping insertion in model container
[2024-02-28 20:48:05,791 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 08:48:05" (1/1) ...
[2024-02-28 20:48:05,832 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-02-28 20:48:06,076 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 20:48:06,082 INFO  L202         MainTranslator]: Completed pre-run
[2024-02-28 20:48:06,112 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 20:48:06,190 INFO  L206         MainTranslator]: Completed translation
[2024-02-28 20:48:06,190 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06 WrapperNode
[2024-02-28 20:48:06,190 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 20:48:06,192 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 20:48:06,192 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 20:48:06,192 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 20:48:06,197 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (1/1) ...
[2024-02-28 20:48:06,211 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (1/1) ...
[2024-02-28 20:48:06,229 INFO  L138                Inliner]: procedures = 265, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80
[2024-02-28 20:48:06,229 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 20:48:06,229 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 20:48:06,229 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 20:48:06,230 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 20:48:06,237 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (1/1) ...
[2024-02-28 20:48:06,237 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (1/1) ...
[2024-02-28 20:48:06,240 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (1/1) ...
[2024-02-28 20:48:06,240 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (1/1) ...
[2024-02-28 20:48:06,247 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (1/1) ...
[2024-02-28 20:48:06,250 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (1/1) ...
[2024-02-28 20:48:06,251 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (1/1) ...
[2024-02-28 20:48:06,252 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (1/1) ...
[2024-02-28 20:48:06,254 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 20:48:06,254 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 20:48:06,255 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 20:48:06,255 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-02-28 20:48:06,255 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (1/1) ...
[2024-02-28 20:48:06,260 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 20:48:06,267 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:48:06,280 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-02-28 20:48:06,283 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-02-28 20:48:06,308 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 20:48:06,308 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 20:48:06,308 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 20:48:06,308 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 20:48:06,308 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 20:48:06,308 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 20:48:06,309 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 20:48:06,309 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 20:48:06,309 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 20:48:06,309 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 20:48:06,309 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 20:48:06,310 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-02-28 20:48:06,447 INFO  L241             CfgBuilder]: Building ICFG
[2024-02-28 20:48:06,448 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 20:48:06,653 INFO  L282             CfgBuilder]: Performing block encoding
[2024-02-28 20:48:06,662 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 20:48:06,662 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 20:48:06,663 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 08:48:06 BoogieIcfgContainer
[2024-02-28 20:48:06,663 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 20:48:06,665 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 20:48:06,665 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 20:48:06,667 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-02-28 20:48:06,667 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 08:48:05" (1/3) ...
[2024-02-28 20:48:06,668 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0ccb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 08:48:06, skipping insertion in model container
[2024-02-28 20:48:06,668 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:48:06" (2/3) ...
[2024-02-28 20:48:06,668 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0ccb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 08:48:06, skipping insertion in model container
[2024-02-28 20:48:06,668 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 08:48:06" (3/3) ...
[2024-02-28 20:48:06,669 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i
[2024-02-28 20:48:06,675 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 20:48:06,683 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 20:48:06,683 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-02-28 20:48:06,683 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 20:48:06,721 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 20:48:06,746 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 213 flow
[2024-02-28 20:48:06,794 INFO  L124   PetriNetUnfolderBase]: 6/152 cut-off events.
[2024-02-28 20:48:06,795 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-02-28 20:48:06,800 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 157 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 303 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. 
[2024-02-28 20:48:06,800 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 213 flow
[2024-02-28 20:48:06,803 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 213 flow
[2024-02-28 20:48:06,810 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 20:48:06,815 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=LoopHeads, 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;@758e2bef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 20:48:06,815 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-02-28 20:48:06,844 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 20:48:06,844 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-02-28 20:48:06,844 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 20:48:06,845 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:06,846 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:48:06,847 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 20:48:06,851 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:06,851 INFO  L85        PathProgramCache]: Analyzing trace with hash 881659394, now seen corresponding path program 1 times
[2024-02-28 20:48:06,858 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:06,858 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566129390]
[2024-02-28 20:48:06,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:06,859 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:06,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:07,357 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 20:48:07,357 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:48:07,357 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566129390]
[2024-02-28 20:48:07,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566129390] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:48:07,358 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:48:07,358 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:48:07,359 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983408975]
[2024-02-28 20:48:07,360 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:48:07,367 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:48:07,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:48:07,390 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:48:07,390 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:48:07,612 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 103
[2024-02-28 20:48:07,615 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 103 transitions, 213 flow. Second operand  has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 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 20:48:07,616 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:48:07,616 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 103
[2024-02-28 20:48:07,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:48:07,813 INFO  L124   PetriNetUnfolderBase]: 117/574 cut-off events.
[2024-02-28 20:48:07,813 INFO  L125   PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES.
[2024-02-28 20:48:07,815 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 886 conditions, 574 events. 117/574 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3181 event pairs, 6 based on Foata normal form. 13/537 useless extension candidates. Maximal degree in co-relation 751. Up to 194 conditions per place. 
[2024-02-28 20:48:07,818 INFO  L140   encePairwiseOnDemand]: 77/103 looper letters, 38 selfloop transitions, 29 changer transitions 1/139 dead transitions.
[2024-02-28 20:48:07,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 139 transitions, 422 flow
[2024-02-28 20:48:07,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:48:07,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:48:07,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions.
[2024-02-28 20:48:07,832 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8203883495145631
[2024-02-28 20:48:07,832 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 507 transitions.
[2024-02-28 20:48:07,833 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 507 transitions.
[2024-02-28 20:48:07,834 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:48:07,836 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 507 transitions.
[2024-02-28 20:48:07,840 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:48:07,845 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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 20:48:07,845 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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 20:48:07,847 INFO  L175             Difference]: Start difference. First operand has 102 places, 103 transitions, 213 flow. Second operand 6 states and 507 transitions.
[2024-02-28 20:48:07,847 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 139 transitions, 422 flow
[2024-02-28 20:48:07,850 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 139 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:48:07,853 INFO  L231             Difference]: Finished difference. Result has 112 places, 128 transitions, 425 flow
[2024-02-28 20:48:07,855 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=112, PETRI_TRANSITIONS=128}
[2024-02-28 20:48:07,857 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places.
[2024-02-28 20:48:07,857 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 128 transitions, 425 flow
[2024-02-28 20:48:07,858 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 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 20:48:07,858 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:07,858 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:48:07,858 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 20:48:07,858 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 20:48:07,859 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:07,859 INFO  L85        PathProgramCache]: Analyzing trace with hash 1137599811, now seen corresponding path program 1 times
[2024-02-28 20:48:07,859 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:07,860 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310915629]
[2024-02-28 20:48:07,860 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:07,860 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:07,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:07,950 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 20:48:07,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:48:07,950 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310915629]
[2024-02-28 20:48:07,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310915629] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:48:07,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:48:07,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:48:07,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420713647]
[2024-02-28 20:48:07,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:48:07,952 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-02-28 20:48:07,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:48:07,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-02-28 20:48:07,953 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-02-28 20:48:08,012 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 103
[2024-02-28 20:48:08,013 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 128 transitions, 425 flow. Second operand  has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 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 20:48:08,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:48:08,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 103
[2024-02-28 20:48:08,013 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:48:08,085 INFO  L124   PetriNetUnfolderBase]: 82/524 cut-off events.
[2024-02-28 20:48:08,085 INFO  L125   PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES.
[2024-02-28 20:48:08,088 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 956 conditions, 524 events. 82/524 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2933 event pairs, 4 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 765. Up to 98 conditions per place. 
[2024-02-28 20:48:08,089 INFO  L140   encePairwiseOnDemand]: 95/103 looper letters, 11 selfloop transitions, 2 changer transitions 5/133 dead transitions.
[2024-02-28 20:48:08,090 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 133 transitions, 471 flow
[2024-02-28 20:48:08,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:48:08,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:48:08,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 541 transitions.
[2024-02-28 20:48:08,092 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8754045307443366
[2024-02-28 20:48:08,092 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 541 transitions.
[2024-02-28 20:48:08,092 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 541 transitions.
[2024-02-28 20:48:08,093 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:48:08,093 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 541 transitions.
[2024-02-28 20:48:08,094 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 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 20:48:08,097 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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 20:48:08,097 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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 20:48:08,097 INFO  L175             Difference]: Start difference. First operand has 112 places, 128 transitions, 425 flow. Second operand 6 states and 541 transitions.
[2024-02-28 20:48:08,097 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 133 transitions, 471 flow
[2024-02-28 20:48:08,102 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 133 transitions, 471 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:48:08,104 INFO  L231             Difference]: Finished difference. Result has 120 places, 128 transitions, 443 flow
[2024-02-28 20:48:08,104 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=443, PETRI_PLACES=120, PETRI_TRANSITIONS=128}
[2024-02-28 20:48:08,104 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places.
[2024-02-28 20:48:08,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 128 transitions, 443 flow
[2024-02-28 20:48:08,105 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 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 20:48:08,105 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:08,105 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:48:08,106 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 20:48:08,106 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 20:48:08,106 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:08,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 57224450, now seen corresponding path program 1 times
[2024-02-28 20:48:08,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:08,107 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838297481]
[2024-02-28 20:48:08,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:08,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:08,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:08,344 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 20:48:08,344 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:48:08,344 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838297481]
[2024-02-28 20:48:08,344 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838297481] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:48:08,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:48:08,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:48:08,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832194564]
[2024-02-28 20:48:08,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:48:08,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:48:08,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:48:08,346 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:48:08,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:48:08,442 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 103
[2024-02-28 20:48:08,443 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 128 transitions, 443 flow. Second operand  has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 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 20:48:08,443 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:48:08,443 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 103
[2024-02-28 20:48:08,443 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:48:08,725 INFO  L124   PetriNetUnfolderBase]: 338/1187 cut-off events.
[2024-02-28 20:48:08,725 INFO  L125   PetriNetUnfolderBase]: For 427/515 co-relation queries the response was YES.
[2024-02-28 20:48:08,728 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2756 conditions, 1187 events. 338/1187 cut-off events. For 427/515 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8176 event pairs, 64 based on Foata normal form. 14/1134 useless extension candidates. Maximal degree in co-relation 2686. Up to 597 conditions per place. 
[2024-02-28 20:48:08,732 INFO  L140   encePairwiseOnDemand]: 80/103 looper letters, 49 selfloop transitions, 82 changer transitions 2/209 dead transitions.
[2024-02-28 20:48:08,732 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 209 transitions, 1045 flow
[2024-02-28 20:48:08,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:48:08,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:48:08,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions.
[2024-02-28 20:48:08,734 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8656957928802589
[2024-02-28 20:48:08,734 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 535 transitions.
[2024-02-28 20:48:08,734 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 535 transitions.
[2024-02-28 20:48:08,734 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:48:08,734 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 535 transitions.
[2024-02-28 20:48:08,736 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 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 20:48:08,737 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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 20:48:08,737 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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 20:48:08,737 INFO  L175             Difference]: Start difference. First operand has 120 places, 128 transitions, 443 flow. Second operand 6 states and 535 transitions.
[2024-02-28 20:48:08,737 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 209 transitions, 1045 flow
[2024-02-28 20:48:08,743 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 209 transitions, 1031 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-02-28 20:48:08,746 INFO  L231             Difference]: Finished difference. Result has 122 places, 207 transitions, 1149 flow
[2024-02-28 20:48:08,746 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1149, PETRI_PLACES=122, PETRI_TRANSITIONS=207}
[2024-02-28 20:48:08,746 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 20 predicate places.
[2024-02-28 20:48:08,746 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 207 transitions, 1149 flow
[2024-02-28 20:48:08,747 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 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 20:48:08,747 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:08,747 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:48:08,747 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 20:48:08,747 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 20:48:08,748 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:08,748 INFO  L85        PathProgramCache]: Analyzing trace with hash -1107170662, now seen corresponding path program 1 times
[2024-02-28 20:48:08,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:08,748 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803293295]
[2024-02-28 20:48:08,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:08,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:08,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 20:48:08,770 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 20:48:08,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 20:48:08,799 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 20:48:08,799 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 20:48:08,800 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-02-28 20:48:08,801 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-02-28 20:48:08,802 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-02-28 20:48:08,802 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-02-28 20:48:08,802 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-02-28 20:48:08,802 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-02-28 20:48:08,802 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-02-28 20:48:08,802 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 20:48:08,802 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-02-28 20:48:08,804 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 20:48:08,804 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 20:48:08,820 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 20:48:08,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 258 flow
[2024-02-28 20:48:08,841 INFO  L124   PetriNetUnfolderBase]: 11/271 cut-off events.
[2024-02-28 20:48:08,841 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-02-28 20:48:08,841 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283 conditions, 271 events. 11/271 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 650 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. 
[2024-02-28 20:48:08,841 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 121 transitions, 258 flow
[2024-02-28 20:48:08,842 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 121 transitions, 258 flow
[2024-02-28 20:48:08,843 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 20:48:08,844 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=LoopHeads, 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;@758e2bef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 20:48:08,844 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-02-28 20:48:08,847 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 20:48:08,847 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-02-28 20:48:08,847 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 20:48:08,847 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:08,848 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:48:08,848 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:48:08,848 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:08,848 INFO  L85        PathProgramCache]: Analyzing trace with hash -1212805221, now seen corresponding path program 1 times
[2024-02-28 20:48:08,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:08,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427651067]
[2024-02-28 20:48:08,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:08,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:08,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:09,007 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 20:48:09,007 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:48:09,007 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427651067]
[2024-02-28 20:48:09,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427651067] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:48:09,007 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:48:09,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:48:09,008 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571820181]
[2024-02-28 20:48:09,008 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:48:09,008 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:48:09,008 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:48:09,008 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:48:09,009 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:48:09,226 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 121
[2024-02-28 20:48:09,226 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 121 transitions, 258 flow. Second operand  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 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 20:48:09,226 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:48:09,226 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 121
[2024-02-28 20:48:09,227 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:48:09,793 INFO  L124   PetriNetUnfolderBase]: 1710/4914 cut-off events.
[2024-02-28 20:48:09,794 INFO  L125   PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES.
[2024-02-28 20:48:09,798 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7978 conditions, 4914 events. 1710/4914 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 40654 event pairs, 258 based on Foata normal form. 85/4617 useless extension candidates. Maximal degree in co-relation 4669. Up to 2239 conditions per place. 
[2024-02-28 20:48:09,811 INFO  L140   encePairwiseOnDemand]: 91/121 looper letters, 46 selfloop transitions, 48 changer transitions 1/178 dead transitions.
[2024-02-28 20:48:09,811 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 178 transitions, 571 flow
[2024-02-28 20:48:09,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:48:09,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:48:09,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions.
[2024-02-28 20:48:09,815 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8347107438016529
[2024-02-28 20:48:09,815 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 606 transitions.
[2024-02-28 20:48:09,816 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions.
[2024-02-28 20:48:09,817 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:48:09,817 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions.
[2024-02-28 20:48:09,820 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 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 20:48:09,823 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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 20:48:09,826 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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 20:48:09,827 INFO  L175             Difference]: Start difference. First operand has 121 places, 121 transitions, 258 flow. Second operand 6 states and 606 transitions.
[2024-02-28 20:48:09,827 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 178 transitions, 571 flow
[2024-02-28 20:48:09,830 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 178 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:48:09,834 INFO  L231             Difference]: Finished difference. Result has 131 places, 165 transitions, 592 flow
[2024-02-28 20:48:09,834 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=592, PETRI_PLACES=131, PETRI_TRANSITIONS=165}
[2024-02-28 20:48:09,836 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places.
[2024-02-28 20:48:09,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 165 transitions, 592 flow
[2024-02-28 20:48:09,836 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 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 20:48:09,837 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:09,837 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:48:09,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 20:48:09,837 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:48:09,838 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:09,838 INFO  L85        PathProgramCache]: Analyzing trace with hash 1567911075, now seen corresponding path program 1 times
[2024-02-28 20:48:09,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:09,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922380686]
[2024-02-28 20:48:09,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:09,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:09,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:09,908 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 20:48:09,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:48:09,908 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922380686]
[2024-02-28 20:48:09,908 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922380686] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:48:09,909 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:48:09,909 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:48:09,909 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922734687]
[2024-02-28 20:48:09,909 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:48:09,910 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-02-28 20:48:09,910 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:48:09,910 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-02-28 20:48:09,910 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-02-28 20:48:09,953 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 121
[2024-02-28 20:48:09,953 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 165 transitions, 592 flow. Second operand  has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 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 20:48:09,953 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:48:09,954 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 121
[2024-02-28 20:48:09,954 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:48:10,236 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([300] L1030-5-->L1030-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][109], [136#true, Black: 124#true, Black: 128#(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: 127#(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)), 85#L1030-6true, Black: 126#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, 76#L1018-8true, threadThread2of2ForFork0InUse, 56#L1018-6true, 129#(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))])
[2024-02-28 20:48:10,236 INFO  L294   olderBase$Statistics]: this new event has 84 ancestors and is not cut-off event
[2024-02-28 20:48:10,237 INFO  L297   olderBase$Statistics]:   existing Event has 84 ancestors and is not cut-off event
[2024-02-28 20:48:10,237 INFO  L297   olderBase$Statistics]:   existing Event has 84 ancestors and is not cut-off event
[2024-02-28 20:48:10,237 INFO  L297   olderBase$Statistics]:   existing Event has 84 ancestors and is not cut-off event
[2024-02-28 20:48:10,328 INFO  L124   PetriNetUnfolderBase]: 1252/4216 cut-off events.
[2024-02-28 20:48:10,328 INFO  L125   PetriNetUnfolderBase]: For 863/867 co-relation queries the response was YES.
[2024-02-28 20:48:10,335 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8138 conditions, 4216 events. 1252/4216 cut-off events. For 863/867 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 36501 event pairs, 176 based on Foata normal form. 1/3991 useless extension candidates. Maximal degree in co-relation 4677. Up to 1342 conditions per place. 
[2024-02-28 20:48:10,348 INFO  L140   encePairwiseOnDemand]: 113/121 looper letters, 14 selfloop transitions, 2 changer transitions 5/171 dead transitions.
[2024-02-28 20:48:10,348 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 171 transitions, 646 flow
[2024-02-28 20:48:10,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:48:10,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:48:10,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 640 transitions.
[2024-02-28 20:48:10,350 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8815426997245179
[2024-02-28 20:48:10,351 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 640 transitions.
[2024-02-28 20:48:10,351 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 640 transitions.
[2024-02-28 20:48:10,351 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:48:10,351 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 640 transitions.
[2024-02-28 20:48:10,353 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 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 20:48:10,354 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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 20:48:10,354 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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 20:48:10,354 INFO  L175             Difference]: Start difference. First operand has 131 places, 165 transitions, 592 flow. Second operand 6 states and 640 transitions.
[2024-02-28 20:48:10,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 171 transitions, 646 flow
[2024-02-28 20:48:10,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 171 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:48:10,366 INFO  L231             Difference]: Finished difference. Result has 139 places, 166 transitions, 614 flow
[2024-02-28 20:48:10,366 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=139, PETRI_TRANSITIONS=166}
[2024-02-28 20:48:10,367 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places.
[2024-02-28 20:48:10,367 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 166 transitions, 614 flow
[2024-02-28 20:48:10,367 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 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 20:48:10,367 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:10,368 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:48:10,368 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 20:48:10,368 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:48:10,368 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:10,368 INFO  L85        PathProgramCache]: Analyzing trace with hash 989517746, now seen corresponding path program 1 times
[2024-02-28 20:48:10,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:10,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44572421]
[2024-02-28 20:48:10,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:10,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:10,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:10,565 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 20:48:10,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:48:10,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44572421]
[2024-02-28 20:48:10,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44572421] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:48:10,566 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:48:10,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:48:10,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490572383]
[2024-02-28 20:48:10,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:48:10,567 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:48:10,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:48:10,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:48:10,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:48:10,673 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 121
[2024-02-28 20:48:10,674 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 166 transitions, 614 flow. Second operand  has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 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 20:48:10,674 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:48:10,674 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 121
[2024-02-28 20:48:10,675 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:48:11,945 INFO  L124   PetriNetUnfolderBase]: 4895/11725 cut-off events.
[2024-02-28 20:48:11,945 INFO  L125   PetriNetUnfolderBase]: For 5280/6910 co-relation queries the response was YES.
[2024-02-28 20:48:11,965 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28897 conditions, 11725 events. 4895/11725 cut-off events. For 5280/6910 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 105324 event pairs, 1132 based on Foata normal form. 45/11078 useless extension candidates. Maximal degree in co-relation 28826. Up to 6769 conditions per place. 
[2024-02-28 20:48:12,004 INFO  L140   encePairwiseOnDemand]: 94/121 looper letters, 80 selfloop transitions, 142 changer transitions 0/311 dead transitions.
[2024-02-28 20:48:12,004 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 311 transitions, 1722 flow
[2024-02-28 20:48:12,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:48:12,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:48:12,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 637 transitions.
[2024-02-28 20:48:12,007 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8774104683195593
[2024-02-28 20:48:12,007 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 637 transitions.
[2024-02-28 20:48:12,007 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 637 transitions.
[2024-02-28 20:48:12,007 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:48:12,008 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 637 transitions.
[2024-02-28 20:48:12,009 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 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 20:48:12,010 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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 20:48:12,010 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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 20:48:12,010 INFO  L175             Difference]: Start difference. First operand has 139 places, 166 transitions, 614 flow. Second operand 6 states and 637 transitions.
[2024-02-28 20:48:12,011 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 311 transitions, 1722 flow
[2024-02-28 20:48:12,021 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 311 transitions, 1710 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-02-28 20:48:12,024 INFO  L231             Difference]: Finished difference. Result has 142 places, 303 transitions, 1900 flow
[2024-02-28 20:48:12,025 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1900, PETRI_PLACES=142, PETRI_TRANSITIONS=303}
[2024-02-28 20:48:12,025 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 21 predicate places.
[2024-02-28 20:48:12,025 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 303 transitions, 1900 flow
[2024-02-28 20:48:12,026 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 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 20:48:12,026 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:12,026 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:48:12,026 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 20:48:12,027 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:48:12,027 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:12,027 INFO  L85        PathProgramCache]: Analyzing trace with hash -1144272540, now seen corresponding path program 1 times
[2024-02-28 20:48:12,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:12,027 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829435729]
[2024-02-28 20:48:12,028 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:12,028 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:12,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:12,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:48:12,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:48:12,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829435729]
[2024-02-28 20:48:12,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829435729] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:48:12,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254315351]
[2024-02-28 20:48:12,380 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:12,380 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:48:12,380 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:48:12,383 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:48:12,387 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-02-28 20:48:12,514 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:12,529 INFO  L262         TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-02-28 20:48:12,537 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:48:12,696 INFO  L378             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 20:48:12,723 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 20:48:12,763 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:48:12,763 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 20:48:12,802 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:48:12,802 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 20:48:12,851 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:48:12,853 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:48:12,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:48:12,862 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:48:12,893 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-02-28 20:48:12,919 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-02-28 20:48:12,945 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-02-28 20:48:13,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-02-28 20:48:13,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254315351] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:48:13,110 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:48:13,110 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29
[2024-02-28 20:48:13,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215117766]
[2024-02-28 20:48:13,110 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:48:13,111 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-02-28 20:48:13,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:48:13,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-02-28 20:48:13,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=604, Unknown=3, NotChecked=156, Total=870
[2024-02-28 20:48:13,114 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 121
[2024-02-28 20:48:13,115 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 303 transitions, 1900 flow. Second operand  has 30 states, 30 states have (on average 60.2) internal successors, (1806), 30 states have internal predecessors, (1806), 0 states have call successors, (0), 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 20:48:13,115 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:48:13,115 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 121
[2024-02-28 20:48:13,115 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:48:16,999 INFO  L124   PetriNetUnfolderBase]: 13429/26307 cut-off events.
[2024-02-28 20:48:16,999 INFO  L125   PetriNetUnfolderBase]: For 27117/27151 co-relation queries the response was YES.
[2024-02-28 20:48:17,049 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 84179 conditions, 26307 events. 13429/26307 cut-off events. For 27117/27151 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 234253 event pairs, 1506 based on Foata normal form. 356/25180 useless extension candidates. Maximal degree in co-relation 71500. Up to 12677 conditions per place. 
[2024-02-28 20:48:17,151 INFO  L140   encePairwiseOnDemand]: 98/121 looper letters, 510 selfloop transitions, 206 changer transitions 1/775 dead transitions.
[2024-02-28 20:48:17,152 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 775 transitions, 6168 flow
[2024-02-28 20:48:17,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-02-28 20:48:17,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-02-28 20:48:17,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1139 transitions.
[2024-02-28 20:48:17,155 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6723730814639906
[2024-02-28 20:48:17,155 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1139 transitions.
[2024-02-28 20:48:17,155 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1139 transitions.
[2024-02-28 20:48:17,156 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:48:17,156 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1139 transitions.
[2024-02-28 20:48:17,158 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 81.35714285714286) internal successors, (1139), 14 states have internal predecessors, (1139), 0 states have call successors, (0), 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 20:48:17,161 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 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 20:48:17,161 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 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 20:48:17,161 INFO  L175             Difference]: Start difference. First operand has 142 places, 303 transitions, 1900 flow. Second operand 14 states and 1139 transitions.
[2024-02-28 20:48:17,161 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 775 transitions, 6168 flow
[2024-02-28 20:48:17,474 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 775 transitions, 6114 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-02-28 20:48:17,481 INFO  L231             Difference]: Finished difference. Result has 164 places, 488 transitions, 4174 flow
[2024-02-28 20:48:17,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4174, PETRI_PLACES=164, PETRI_TRANSITIONS=488}
[2024-02-28 20:48:17,482 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 43 predicate places.
[2024-02-28 20:48:17,482 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 488 transitions, 4174 flow
[2024-02-28 20:48:17,483 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 60.2) internal successors, (1806), 30 states have internal predecessors, (1806), 0 states have call successors, (0), 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 20:48:17,483 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:17,483 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:48:17,489 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-02-28 20:48:17,688 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:48:17,689 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:48:17,690 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:17,690 INFO  L85        PathProgramCache]: Analyzing trace with hash -687447138, now seen corresponding path program 1 times
[2024-02-28 20:48:17,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:17,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848175220]
[2024-02-28 20:48:17,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:17,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:17,713 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:18,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:48:18,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:48:18,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848175220]
[2024-02-28 20:48:18,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848175220] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:48:18,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146991570]
[2024-02-28 20:48:18,138 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:18,138 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:48:18,138 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:48:18,139 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:48:18,141 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-02-28 20:48:18,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:18,219 INFO  L262         TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjunts are in the unsatisfiable core
[2024-02-28 20:48:18,222 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:48:18,423 INFO  L378             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 20:48:18,451 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:48:18,492 INFO  L378             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 26 treesize of output 28
[2024-02-28 20:48:18,543 INFO  L378             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 33 treesize of output 38
[2024-02-28 20:48:18,701 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:48:18,701 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:48:18,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:48:18,736 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:48:18,761 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false
[2024-02-28 20:48:18,849 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2024-02-28 20:48:18,906 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21)))))) is different from false
[2024-02-28 20:48:18,942 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1))))))))) is different from false
[2024-02-28 20:48:18,980 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))))) is different from false
[2024-02-28 20:48:19,009 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:48:19,009 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2024-02-28 20:48:19,016 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:48:19,016 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2024-02-28 20:48:19,019 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2024-02-28 20:48:19,026 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 20:48:19,026 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-02-28 20:48:19,032 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 20:48:19,032 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-02-28 20:48:19,038 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 20:48:19,039 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-02-28 20:48:19,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-02-28 20:48:19,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146991570] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:48:19,157 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:48:19,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33
[2024-02-28 20:48:19,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281622743]
[2024-02-28 20:48:19,158 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:48:19,158 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2024-02-28 20:48:19,159 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:48:19,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2024-02-28 20:48:19,160 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=701, Unknown=5, NotChecked=290, Total=1122
[2024-02-28 20:48:19,222 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 121
[2024-02-28 20:48:19,224 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 488 transitions, 4174 flow. Second operand  has 34 states, 34 states have (on average 62.05882352941177) internal successors, (2110), 34 states have internal predecessors, (2110), 0 states have call successors, (0), 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 20:48:19,224 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:48:19,224 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 121
[2024-02-28 20:48:19,224 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:48:24,984 INFO  L124   PetriNetUnfolderBase]: 15344/30434 cut-off events.
[2024-02-28 20:48:24,984 INFO  L125   PetriNetUnfolderBase]: For 76224/76452 co-relation queries the response was YES.
[2024-02-28 20:48:25,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 121317 conditions, 30434 events. 15344/30434 cut-off events. For 76224/76452 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 272620 event pairs, 1348 based on Foata normal form. 210/28772 useless extension candidates. Maximal degree in co-relation 113712. Up to 13023 conditions per place. 
[2024-02-28 20:48:25,164 INFO  L140   encePairwiseOnDemand]: 87/121 looper letters, 554 selfloop transitions, 282 changer transitions 4/904 dead transitions.
[2024-02-28 20:48:25,164 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 904 transitions, 8990 flow
[2024-02-28 20:48:25,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-02-28 20:48:25,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-02-28 20:48:25,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1187 transitions.
[2024-02-28 20:48:25,167 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6539944903581267
[2024-02-28 20:48:25,167 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1187 transitions.
[2024-02-28 20:48:25,167 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1187 transitions.
[2024-02-28 20:48:25,168 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:48:25,168 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1187 transitions.
[2024-02-28 20:48:25,170 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 79.13333333333334) internal successors, (1187), 15 states have internal predecessors, (1187), 0 states have call successors, (0), 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 20:48:25,172 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 121.0) internal successors, (1936), 16 states have internal predecessors, (1936), 0 states have call successors, (0), 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 20:48:25,172 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 121.0) internal successors, (1936), 16 states have internal predecessors, (1936), 0 states have call successors, (0), 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 20:48:25,172 INFO  L175             Difference]: Start difference. First operand has 164 places, 488 transitions, 4174 flow. Second operand 15 states and 1187 transitions.
[2024-02-28 20:48:25,172 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 904 transitions, 8990 flow
[2024-02-28 20:48:26,363 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 904 transitions, 8964 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-02-28 20:48:26,371 INFO  L231             Difference]: Finished difference. Result has 183 places, 643 transitions, 7009 flow
[2024-02-28 20:48:26,372 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=4150, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7009, PETRI_PLACES=183, PETRI_TRANSITIONS=643}
[2024-02-28 20:48:26,372 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 62 predicate places.
[2024-02-28 20:48:26,372 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 643 transitions, 7009 flow
[2024-02-28 20:48:26,373 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 62.05882352941177) internal successors, (2110), 34 states have internal predecessors, (2110), 0 states have call successors, (0), 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 20:48:26,373 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:26,373 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:48:26,381 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-02-28 20:48:26,574 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2024-02-28 20:48:26,574 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:48:26,575 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:26,575 INFO  L85        PathProgramCache]: Analyzing trace with hash -448355592, now seen corresponding path program 1 times
[2024-02-28 20:48:26,576 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:26,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356870846]
[2024-02-28 20:48:26,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:26,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:26,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:26,778 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 20:48:26,778 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:48:26,779 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356870846]
[2024-02-28 20:48:26,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356870846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:48:26,779 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:48:26,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:48:26,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382248986]
[2024-02-28 20:48:26,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:48:26,779 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:48:26,779 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:48:26,780 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:48:26,780 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:48:27,004 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 121
[2024-02-28 20:48:27,005 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 643 transitions, 7009 flow. Second operand  has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 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 20:48:27,005 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:48:27,005 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 121
[2024-02-28 20:48:27,005 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:48:29,641 INFO  L124   PetriNetUnfolderBase]: 8450/19286 cut-off events.
[2024-02-28 20:48:29,642 INFO  L125   PetriNetUnfolderBase]: For 91085/92668 co-relation queries the response was YES.
[2024-02-28 20:48:29,704 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88668 conditions, 19286 events. 8450/19286 cut-off events. For 91085/92668 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 178428 event pairs, 714 based on Foata normal form. 220/18901 useless extension candidates. Maximal degree in co-relation 85070. Up to 8358 conditions per place. 
[2024-02-28 20:48:29,771 INFO  L140   encePairwiseOnDemand]: 106/121 looper letters, 376 selfloop transitions, 259 changer transitions 0/893 dead transitions.
[2024-02-28 20:48:29,772 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 893 transitions, 11552 flow
[2024-02-28 20:48:29,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:48:29,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:48:29,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions.
[2024-02-28 20:48:29,773 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8581267217630854
[2024-02-28 20:48:29,773 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 623 transitions.
[2024-02-28 20:48:29,773 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 623 transitions.
[2024-02-28 20:48:29,774 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:48:29,774 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 623 transitions.
[2024-02-28 20:48:29,775 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 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 20:48:29,776 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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 20:48:29,776 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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 20:48:29,776 INFO  L175             Difference]: Start difference. First operand has 183 places, 643 transitions, 7009 flow. Second operand 6 states and 623 transitions.
[2024-02-28 20:48:29,776 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 893 transitions, 11552 flow
[2024-02-28 20:48:30,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 893 transitions, 11519 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-02-28 20:48:30,383 INFO  L231             Difference]: Finished difference. Result has 188 places, 891 transitions, 11450 flow
[2024-02-28 20:48:30,383 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=6976, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11450, PETRI_PLACES=188, PETRI_TRANSITIONS=891}
[2024-02-28 20:48:30,384 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 67 predicate places.
[2024-02-28 20:48:30,384 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 891 transitions, 11450 flow
[2024-02-28 20:48:30,384 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 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 20:48:30,384 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:30,384 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:48:30,384 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 20:48:30,385 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:48:30,385 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:30,385 INFO  L85        PathProgramCache]: Analyzing trace with hash 96867766, now seen corresponding path program 1 times
[2024-02-28 20:48:30,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:30,385 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461046446]
[2024-02-28 20:48:30,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:30,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:30,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:30,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-02-28 20:48:30,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:48:30,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461046446]
[2024-02-28 20:48:30,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461046446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:48:30,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:48:30,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:48:30,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255462026]
[2024-02-28 20:48:30,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:48:30,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:48:30,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:48:30,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:48:30,678 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:48:30,801 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 121
[2024-02-28 20:48:30,801 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 891 transitions, 11450 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:48:30,802 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:48:30,802 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 121
[2024-02-28 20:48:30,802 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:48:36,607 INFO  L124   PetriNetUnfolderBase]: 15899/34933 cut-off events.
[2024-02-28 20:48:36,607 INFO  L125   PetriNetUnfolderBase]: For 181412/193973 co-relation queries the response was YES.
[2024-02-28 20:48:36,773 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164299 conditions, 34933 events. 15899/34933 cut-off events. For 181412/193973 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 356309 event pairs, 2000 based on Foata normal form. 656/34097 useless extension candidates. Maximal degree in co-relation 159000. Up to 20002 conditions per place. 
[2024-02-28 20:48:36,907 INFO  L140   encePairwiseOnDemand]: 94/121 looper letters, 685 selfloop transitions, 495 changer transitions 4/1322 dead transitions.
[2024-02-28 20:48:36,907 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 1322 transitions, 18790 flow
[2024-02-28 20:48:36,908 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:48:36,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:48:36,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions.
[2024-02-28 20:48:36,909 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.871900826446281
[2024-02-28 20:48:36,909 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 633 transitions.
[2024-02-28 20:48:36,909 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions.
[2024-02-28 20:48:36,910 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:48:36,910 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions.
[2024-02-28 20:48:36,911 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 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 20:48:36,911 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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 20:48:36,912 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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 20:48:36,912 INFO  L175             Difference]: Start difference. First operand has 188 places, 891 transitions, 11450 flow. Second operand 6 states and 633 transitions.
[2024-02-28 20:48:36,912 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 1322 transitions, 18790 flow
[2024-02-28 20:48:38,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1322 transitions, 18574 flow, removed 108 selfloop flow, removed 0 redundant places.
[2024-02-28 20:48:38,787 INFO  L231             Difference]: Finished difference. Result has 198 places, 1314 transitions, 18684 flow
[2024-02-28 20:48:38,788 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=11342, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18684, PETRI_PLACES=198, PETRI_TRANSITIONS=1314}
[2024-02-28 20:48:38,788 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 77 predicate places.
[2024-02-28 20:48:38,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 1314 transitions, 18684 flow
[2024-02-28 20:48:38,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:48:38,789 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:48:38,789 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:48:38,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 20:48:38,789 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:48:38,789 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:48:38,789 INFO  L85        PathProgramCache]: Analyzing trace with hash 880080051, now seen corresponding path program 1 times
[2024-02-28 20:48:38,789 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:48:38,789 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072691820]
[2024-02-28 20:48:38,789 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:38,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:48:38,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:39,438 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 20:48:39,438 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:48:39,438 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072691820]
[2024-02-28 20:48:39,438 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072691820] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:48:39,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654207931]
[2024-02-28 20:48:39,439 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:48:39,439 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:48:39,439 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:48:39,440 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:48:39,447 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-02-28 20:48:39,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:48:39,541 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-02-28 20:48:39,547 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:48:39,554 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-02-28 20:48:39,564 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:48:39,564 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14
[2024-02-28 20:48:39,628 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:48:39,644 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-02-28 20:48:39,644 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-02-28 20:48:39,823 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:48:39,823 INFO  L378             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 34 treesize of output 33
[2024-02-28 20:48:39,936 INFO  L378             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 26 treesize of output 19
[2024-02-28 20:48:39,952 INFO  L378             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 11 treesize of output 7
[2024-02-28 20:48:39,998 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 20:48:40,052 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:48:40,052 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 20:48:40,113 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:48:40,113 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 20:48:40,358 INFO  L378             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 20:48:40,414 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:48:40,434 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:48:40,459 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:48:40,486 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:48:40,521 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:48:40,530 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 20:48:40,530 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:48:40,556 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_522 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_522 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_522 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-02-28 20:48:40,593 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-02-28 20:48:40,647 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (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_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))))) is different from false
[2024-02-28 20:48:40,802 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-02-28 20:48:40,820 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-02-28 20:48:41,145 INFO  L378             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 41 treesize of output 29
[2024-02-28 20:48:41,273 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 20:48:41,274 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [654207931] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:48:41,274 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:48:41,274 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 41
[2024-02-28 20:48:41,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952922588]
[2024-02-28 20:48:41,274 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:48:41,274 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-02-28 20:48:41,275 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:48:41,275 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-02-28 20:48:41,275 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1200, Unknown=8, NotChecked=370, Total=1722
[2024-02-28 20:48:41,315 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-02-28 20:48:41,317 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 1314 transitions, 18684 flow. Second operand  has 42 states, 42 states have (on average 52.166666666666664) internal successors, (2191), 42 states have internal predecessors, (2191), 0 states have call successors, (0), 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 20:48:41,317 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:48:41,317 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-02-28 20:48:41,317 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:48:58,765 INFO  L124   PetriNetUnfolderBase]: 31367/58933 cut-off events.
[2024-02-28 20:48:58,766 INFO  L125   PetriNetUnfolderBase]: For 386458/386594 co-relation queries the response was YES.
[2024-02-28 20:48:59,073 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 310767 conditions, 58933 events. 31367/58933 cut-off events. For 386458/386594 co-relation queries the response was YES. Maximal size of possible extension queue 1839. Compared 556075 event pairs, 3397 based on Foata normal form. 52/58746 useless extension candidates. Maximal degree in co-relation 291462. Up to 36625 conditions per place. 
[2024-02-28 20:48:59,310 INFO  L140   encePairwiseOnDemand]: 78/121 looper letters, 1775 selfloop transitions, 460 changer transitions 22/2308 dead transitions.
[2024-02-28 20:48:59,310 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 2308 transitions, 34801 flow
[2024-02-28 20:48:59,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-02-28 20:48:59,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-02-28 20:48:59,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2206 transitions.
[2024-02-28 20:48:59,320 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5208972845336481
[2024-02-28 20:48:59,321 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 2206 transitions.
[2024-02-28 20:48:59,321 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 2206 transitions.
[2024-02-28 20:48:59,323 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:48:59,323 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2206 transitions.
[2024-02-28 20:48:59,327 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 63.02857142857143) internal successors, (2206), 35 states have internal predecessors, (2206), 0 states have call successors, (0), 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 20:48:59,330 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 121.0) internal successors, (4356), 36 states have internal predecessors, (4356), 0 states have call successors, (0), 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 20:48:59,331 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 121.0) internal successors, (4356), 36 states have internal predecessors, (4356), 0 states have call successors, (0), 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 20:48:59,331 INFO  L175             Difference]: Start difference. First operand has 198 places, 1314 transitions, 18684 flow. Second operand 35 states and 2206 transitions.
[2024-02-28 20:48:59,331 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 2308 transitions, 34801 flow
[2024-02-28 20:49:06,962 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 2308 transitions, 34477 flow, removed 162 selfloop flow, removed 0 redundant places.
[2024-02-28 20:49:06,995 INFO  L231             Difference]: Finished difference. Result has 250 places, 1645 transitions, 24839 flow
[2024-02-28 20:49:06,996 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=18432, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=24839, PETRI_PLACES=250, PETRI_TRANSITIONS=1645}
[2024-02-28 20:49:06,996 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 129 predicate places.
[2024-02-28 20:49:06,996 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 1645 transitions, 24839 flow
[2024-02-28 20:49:06,997 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 52.166666666666664) internal successors, (2191), 42 states have internal predecessors, (2191), 0 states have call successors, (0), 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 20:49:06,997 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:49:06,999 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:49:07,007 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-02-28 20:49:07,200 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:49:07,201 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:49:07,201 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:49:07,201 INFO  L85        PathProgramCache]: Analyzing trace with hash -85146821, now seen corresponding path program 2 times
[2024-02-28 20:49:07,202 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:49:07,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261492557]
[2024-02-28 20:49:07,202 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:49:07,202 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:49:07,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:49:07,719 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 20:49:07,719 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:49:07,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261492557]
[2024-02-28 20:49:07,719 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261492557] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:49:07,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055459272]
[2024-02-28 20:49:07,719 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 20:49:07,719 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:49:07,720 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:49:07,720 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:49:07,721 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-02-28 20:49:07,898 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:49:07,898 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:49:07,900 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core
[2024-02-28 20:49:07,906 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:49:07,955 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-02-28 20:49:08,052 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:49:08,053 INFO  L378             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 15 treesize of output 15
[2024-02-28 20:49:08,274 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:49:08,275 INFO  L378             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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-02-28 20:49:08,456 INFO  L378             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 20:49:08,521 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:49:08,557 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:49:08,600 INFO  L378             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 26 treesize of output 28
[2024-02-28 20:49:08,651 INFO  L378             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 33 treesize of output 38
[2024-02-28 20:49:08,706 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:49:08,751 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 20:49:08,752 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:49:08,772 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_621 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-02-28 20:49:08,790 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_621 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-02-28 20:49:08,808 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_621 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_621 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_621) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-02-28 20:49:08,956 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_612) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2024-02-28 20:49:08,974 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_612) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc7#1.base|))) is different from false
[2024-02-28 20:49:09,023 INFO  L378             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 45 treesize of output 29
[2024-02-28 20:49:09,025 INFO  L378             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 8 treesize of output 6
[2024-02-28 20:49:09,071 INFO  L378             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 10 treesize of output 8
[2024-02-28 20:49:09,102 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 20:49:09,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055459272] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:49:09,102 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:49:09,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 41
[2024-02-28 20:49:09,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769109883]
[2024-02-28 20:49:09,102 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:49:09,103 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-02-28 20:49:09,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:49:09,103 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-02-28 20:49:09,104 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1197, Unknown=14, NotChecked=370, Total=1722
[2024-02-28 20:49:09,188 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-02-28 20:49:09,190 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 1645 transitions, 24839 flow. Second operand  has 42 states, 42 states have (on average 52.07142857142857) internal successors, (2187), 42 states have internal predecessors, (2187), 0 states have call successors, (0), 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 20:49:09,190 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:49:09,190 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-02-28 20:49:09,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:49:35,443 INFO  L124   PetriNetUnfolderBase]: 45017/83236 cut-off events.
[2024-02-28 20:49:35,443 INFO  L125   PetriNetUnfolderBase]: For 678602/679465 co-relation queries the response was YES.
[2024-02-28 20:49:36,184 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 482246 conditions, 83236 events. 45017/83236 cut-off events. For 678602/679465 co-relation queries the response was YES. Maximal size of possible extension queue 2750. Compared 818002 event pairs, 6883 based on Foata normal form. 431/83403 useless extension candidates. Maximal degree in co-relation 481418. Up to 39250 conditions per place. 
[2024-02-28 20:49:36,543 INFO  L140   encePairwiseOnDemand]: 76/121 looper letters, 2382 selfloop transitions, 1007 changer transitions 30/3470 dead transitions.
[2024-02-28 20:49:36,544 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 3470 transitions, 58945 flow
[2024-02-28 20:49:36,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-02-28 20:49:36,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-02-28 20:49:36,546 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1942 transitions.
[2024-02-28 20:49:36,546 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5349862258953169
[2024-02-28 20:49:36,546 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1942 transitions.
[2024-02-28 20:49:36,547 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1942 transitions.
[2024-02-28 20:49:36,548 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:49:36,548 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1942 transitions.
[2024-02-28 20:49:36,550 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 64.73333333333333) internal successors, (1942), 30 states have internal predecessors, (1942), 0 states have call successors, (0), 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 20:49:36,554 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 121.0) internal successors, (3751), 31 states have internal predecessors, (3751), 0 states have call successors, (0), 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 20:49:36,554 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 121.0) internal successors, (3751), 31 states have internal predecessors, (3751), 0 states have call successors, (0), 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 20:49:36,555 INFO  L175             Difference]: Start difference. First operand has 250 places, 1645 transitions, 24839 flow. Second operand 30 states and 1942 transitions.
[2024-02-28 20:49:36,555 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 3470 transitions, 58945 flow
[2024-02-28 20:49:54,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 3470 transitions, 58781 flow, removed 76 selfloop flow, removed 6 redundant places.
[2024-02-28 20:49:54,985 INFO  L231             Difference]: Finished difference. Result has 289 places, 2426 transitions, 43082 flow
[2024-02-28 20:49:54,986 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=24717, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=350, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=954, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=43082, PETRI_PLACES=289, PETRI_TRANSITIONS=2426}
[2024-02-28 20:49:54,986 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 168 predicate places.
[2024-02-28 20:49:54,987 INFO  L495      AbstractCegarLoop]: Abstraction has has 289 places, 2426 transitions, 43082 flow
[2024-02-28 20:49:54,988 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 52.07142857142857) internal successors, (2187), 42 states have internal predecessors, (2187), 0 states have call successors, (0), 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 20:49:54,988 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:49:54,988 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:49:54,992 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-02-28 20:49:55,188 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2024-02-28 20:49:55,189 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:49:55,190 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:49:55,190 INFO  L85        PathProgramCache]: Analyzing trace with hash -581517331, now seen corresponding path program 3 times
[2024-02-28 20:49:55,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:49:55,191 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340181757]
[2024-02-28 20:49:55,191 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:49:55,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:49:55,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:49:55,685 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 20:49:55,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:49:55,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340181757]
[2024-02-28 20:49:55,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340181757] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:49:55,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681040971]
[2024-02-28 20:49:55,686 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 20:49:55,686 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:49:55,686 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:49:55,687 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:49:55,688 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-02-28 20:49:55,841 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 20:49:55,841 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:49:55,843 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 63 conjunts are in the unsatisfiable core
[2024-02-28 20:49:55,856 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:49:55,953 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-02-28 20:49:55,996 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:49:55,996 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14
[2024-02-28 20:49:56,087 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:49:56,098 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-02-28 20:49:56,098 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-02-28 20:49:56,395 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:49:56,396 INFO  L378             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 34 treesize of output 33
[2024-02-28 20:49:56,810 INFO  L378             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 26 treesize of output 19
[2024-02-28 20:49:56,827 INFO  L378             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 20:49:56,885 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:49:56,923 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:49:56,967 INFO  L378             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 26 treesize of output 28
[2024-02-28 20:49:57,016 INFO  L378             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 33 treesize of output 38
[2024-02-28 20:49:57,084 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:49:57,126 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 20:49:57,126 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:49:57,145 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-02-28 20:49:57,170 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-02-28 20:49:57,187 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_722 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_722 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_722) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-02-28 20:49:57,898 INFO  L378             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 73 treesize of output 57
[2024-02-28 20:49:57,902 INFO  L378             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 52 treesize of output 48
[2024-02-28 20:49:57,909 INFO  L378             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 48 treesize of output 46
[2024-02-28 20:49:58,082 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 20:49:58,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [681040971] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:49:58,082 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:49:58,082 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 20] total 53
[2024-02-28 20:49:58,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267908895]
[2024-02-28 20:49:58,083 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:49:58,083 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 54 states
[2024-02-28 20:49:58,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:49:58,084 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants.
[2024-02-28 20:49:58,085 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2339, Unknown=11, NotChecked=300, Total=2862
[2024-02-28 20:49:58,384 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 34 out of 121
[2024-02-28 20:49:58,385 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 2426 transitions, 43082 flow. Second operand  has 54 states, 54 states have (on average 36.2037037037037) internal successors, (1955), 54 states have internal predecessors, (1955), 0 states have call successors, (0), 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 20:49:58,385 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:49:58,385 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 121
[2024-02-28 20:49:58,385 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:50:53,606 INFO  L124   PetriNetUnfolderBase]: 64158/116249 cut-off events.
[2024-02-28 20:50:53,606 INFO  L125   PetriNetUnfolderBase]: For 1425244/1426112 co-relation queries the response was YES.
[2024-02-28 20:50:54,963 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 768041 conditions, 116249 events. 64158/116249 cut-off events. For 1425244/1426112 co-relation queries the response was YES. Maximal size of possible extension queue 3607. Compared 1153438 event pairs, 6400 based on Foata normal form. 803/116554 useless extension candidates. Maximal degree in co-relation 767147. Up to 40491 conditions per place. 
[2024-02-28 20:50:55,524 INFO  L140   encePairwiseOnDemand]: 67/121 looper letters, 3258 selfloop transitions, 2185 changer transitions 45/5524 dead transitions.
[2024-02-28 20:50:55,524 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 5524 transitions, 103450 flow
[2024-02-28 20:50:55,525 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. 
[2024-02-28 20:50:55,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2024-02-28 20:50:55,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 2656 transitions.
[2024-02-28 20:50:55,527 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3990984222389181
[2024-02-28 20:50:55,527 INFO  L72            ComplementDD]: Start complementDD. Operand 55 states and 2656 transitions.
[2024-02-28 20:50:55,528 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 55 states and 2656 transitions.
[2024-02-28 20:50:55,528 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:50:55,528 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 2656 transitions.
[2024-02-28 20:50:55,532 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 56 states, 55 states have (on average 48.29090909090909) internal successors, (2656), 55 states have internal predecessors, (2656), 0 states have call successors, (0), 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 20:50:55,537 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 56 states, 56 states have (on average 121.0) internal successors, (6776), 56 states have internal predecessors, (6776), 0 states have call successors, (0), 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 20:50:55,537 INFO  L81            ComplementDD]: Finished complementDD. Result  has 56 states, 56 states have (on average 121.0) internal successors, (6776), 56 states have internal predecessors, (6776), 0 states have call successors, (0), 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 20:50:55,537 INFO  L175             Difference]: Start difference. First operand has 289 places, 2426 transitions, 43082 flow. Second operand 55 states and 2656 transitions.
[2024-02-28 20:50:55,538 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 5524 transitions, 103450 flow
[2024-02-28 20:51:45,381 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 5524 transitions, 103132 flow, removed 130 selfloop flow, removed 15 redundant places.
[2024-02-28 20:51:45,453 INFO  L231             Difference]: Finished difference. Result has 352 places, 3755 transitions, 77628 flow
[2024-02-28 20:51:45,455 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=42911, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1023, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=77628, PETRI_PLACES=352, PETRI_TRANSITIONS=3755}
[2024-02-28 20:51:45,455 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 231 predicate places.
[2024-02-28 20:51:45,456 INFO  L495      AbstractCegarLoop]: Abstraction has has 352 places, 3755 transitions, 77628 flow
[2024-02-28 20:51:45,457 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 54 states, 54 states have (on average 36.2037037037037) internal successors, (1955), 54 states have internal predecessors, (1955), 0 states have call successors, (0), 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 20:51:45,457 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:51:45,457 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:51:45,462 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-02-28 20:51:45,661 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:51:45,662 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:51:45,662 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:51:45,663 INFO  L85        PathProgramCache]: Analyzing trace with hash -344394265, now seen corresponding path program 4 times
[2024-02-28 20:51:45,663 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:51:45,663 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714100507]
[2024-02-28 20:51:45,663 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:51:45,664 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:51:45,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:51:46,267 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 20:51:46,267 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:51:46,267 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714100507]
[2024-02-28 20:51:46,267 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714100507] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:51:46,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205123205]
[2024-02-28 20:51:46,268 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 20:51:46,268 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:51:46,268 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:51:46,269 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:51:46,270 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-02-28 20:51:46,430 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 20:51:46,430 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:51:46,435 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 58 conjunts are in the unsatisfiable core
[2024-02-28 20:51:46,440 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:51:46,473 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-02-28 20:51:46,575 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:51:46,575 INFO  L378             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 15 treesize of output 15
[2024-02-28 20:51:46,858 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:51:46,859 INFO  L378             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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-02-28 20:51:47,107 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:51:47,108 INFO  L378             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 26 treesize of output 19
[2024-02-28 20:51:47,138 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:51:47,221 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:51:47,289 INFO  L378             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 26 treesize of output 28
[2024-02-28 20:51:47,438 INFO  L378             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 20:51:47,501 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:51:47,502 INFO  L378             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 21
[2024-02-28 20:51:47,526 INFO  L378             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 33 treesize of output 38
[2024-02-28 20:51:47,605 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:51:47,606 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:51:47,636 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:51:47,637 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:51:47,670 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:51:47,671 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:51:47,751 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:51:47,802 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 20:51:47,802 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:51:47,953 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-02-28 20:51:47,995 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-02-28 20:51:48,016 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-02-28 20:51:48,040 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) .cse1 v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) .cse1 v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) .cse1 v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_820 (Array Int Int)) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_820) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_825) .cse1 v_ArrVal_826) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-02-28 20:51:48,502 INFO  L378             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 62 treesize of output 46
[2024-02-28 20:51:48,593 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:51:48,593 INFO  L378             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 40
[2024-02-28 20:51:48,652 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 20:51:48,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [205123205] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:51:48,652 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:51:48,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 44
[2024-02-28 20:51:48,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681370284]
[2024-02-28 20:51:48,653 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:51:48,653 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 45 states
[2024-02-28 20:51:48,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:51:48,654 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants.
[2024-02-28 20:51:48,655 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1474, Unknown=21, NotChecked=324, Total=1980
[2024-02-28 20:51:49,121 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-02-28 20:51:49,124 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 3755 transitions, 77628 flow. Second operand  has 45 states, 45 states have (on average 52.06666666666667) internal successors, (2343), 45 states have internal predecessors, (2343), 0 states have call successors, (0), 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 20:51:49,124 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:51:49,125 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-02-28 20:51:49,125 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:53:04,563 INFO  L124   PetriNetUnfolderBase]: 62997/114619 cut-off events.
[2024-02-28 20:53:04,563 INFO  L125   PetriNetUnfolderBase]: For 2131070/2147191 co-relation queries the response was YES.
[2024-02-28 20:53:06,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 857809 conditions, 114619 events. 62997/114619 cut-off events. For 2131070/2147191 co-relation queries the response was YES. Maximal size of possible extension queue 3643. Compared 1145053 event pairs, 7178 based on Foata normal form. 798/115001 useless extension candidates. Maximal degree in co-relation 857688. Up to 74372 conditions per place. 
[2024-02-28 20:53:06,913 INFO  L140   encePairwiseOnDemand]: 78/121 looper letters, 3279 selfloop transitions, 1376 changer transitions 19/4747 dead transitions.
[2024-02-28 20:53:06,914 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 4747 transitions, 103486 flow
[2024-02-28 20:53:06,914 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. 
[2024-02-28 20:53:06,914 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 42 states.
[2024-02-28 20:53:06,916 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 2642 transitions.
[2024-02-28 20:53:06,916 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5198740653286108
[2024-02-28 20:53:06,917 INFO  L72            ComplementDD]: Start complementDD. Operand 42 states and 2642 transitions.
[2024-02-28 20:53:06,917 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 42 states and 2642 transitions.
[2024-02-28 20:53:06,917 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:53:06,917 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 2642 transitions.
[2024-02-28 20:53:06,920 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 43 states, 42 states have (on average 62.904761904761905) internal successors, (2642), 42 states have internal predecessors, (2642), 0 states have call successors, (0), 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 20:53:06,924 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 43 states, 43 states have (on average 121.0) internal successors, (5203), 43 states have internal predecessors, (5203), 0 states have call successors, (0), 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 20:53:06,925 INFO  L81            ComplementDD]: Finished complementDD. Result  has 43 states, 43 states have (on average 121.0) internal successors, (5203), 43 states have internal predecessors, (5203), 0 states have call successors, (0), 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 20:53:06,925 INFO  L175             Difference]: Start difference. First operand has 352 places, 3755 transitions, 77628 flow. Second operand 42 states and 2642 transitions.
[2024-02-28 20:53:06,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 4747 transitions, 103486 flow
[2024-02-28 20:54:16,449 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 4747 transitions, 102924 flow, removed 241 selfloop flow, removed 20 redundant places.
[2024-02-28 20:54:16,526 INFO  L231             Difference]: Finished difference. Result has 379 places, 4019 transitions, 88528 flow
[2024-02-28 20:54:16,528 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=77108, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=88528, PETRI_PLACES=379, PETRI_TRANSITIONS=4019}
[2024-02-28 20:54:16,529 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 258 predicate places.
[2024-02-28 20:54:16,529 INFO  L495      AbstractCegarLoop]: Abstraction has has 379 places, 4019 transitions, 88528 flow
[2024-02-28 20:54:16,529 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 45 states, 45 states have (on average 52.06666666666667) internal successors, (2343), 45 states have internal predecessors, (2343), 0 states have call successors, (0), 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 20:54:16,529 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:54:16,529 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:54:16,545 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-02-28 20:54:16,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-02-28 20:54:16,734 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:54:16,736 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:54:16,736 INFO  L85        PathProgramCache]: Analyzing trace with hash -670267871, now seen corresponding path program 5 times
[2024-02-28 20:54:16,736 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:54:16,736 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850269469]
[2024-02-28 20:54:16,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:54:16,737 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:54:16,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:54:17,321 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 20:54:17,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:54:17,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850269469]
[2024-02-28 20:54:17,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850269469] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:54:17,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757769506]
[2024-02-28 20:54:17,322 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-02-28 20:54:17,322 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:54:17,322 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:54:17,323 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:54:17,324 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-02-28 20:54:17,461 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:54:17,461 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:54:17,463 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-02-28 20:54:17,469 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:54:17,475 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-02-28 20:54:17,505 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:54:17,505 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14
[2024-02-28 20:54:17,547 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:54:17,556 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-02-28 20:54:17,556 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-02-28 20:54:17,682 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:54:17,682 INFO  L378             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 34 treesize of output 33
[2024-02-28 20:54:17,770 INFO  L378             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 26 treesize of output 19
[2024-02-28 20:54:17,786 INFO  L378             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 11 treesize of output 7
[2024-02-28 20:54:17,873 INFO  L378             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 20:54:17,912 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-02-28 20:54:17,951 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:54:17,951 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-02-28 20:54:17,998 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:54:17,998 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-02-28 20:54:18,052 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:54:18,068 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:54:18,086 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:54:18,104 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:54:18,136 INFO  L378             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 43 treesize of output 32
[2024-02-28 20:54:18,145 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 20:54:18,145 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:54:18,165 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_931 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_931 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_931 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-02-28 20:54:18,211 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-02-28 20:54:18,262 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2024-02-28 20:54:18,285 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_930) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_931) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-02-28 20:54:18,583 INFO  L378             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 41 treesize of output 29
[2024-02-28 20:54:18,691 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 20:54:18,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757769506] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:54:18,691 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:54:18,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 41
[2024-02-28 20:54:18,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630314972]
[2024-02-28 20:54:18,692 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:54:18,692 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-02-28 20:54:18,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:54:18,693 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-02-28 20:54:18,694 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1278, Unknown=6, NotChecked=300, Total=1722
[2024-02-28 20:54:18,885 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-02-28 20:54:18,886 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 4019 transitions, 88528 flow. Second operand  has 42 states, 42 states have (on average 52.142857142857146) internal successors, (2190), 42 states have internal predecessors, (2190), 0 states have call successors, (0), 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 20:54:18,886 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:54:18,886 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-02-28 20:54:18,886 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:55:40,109 INFO  L124   PetriNetUnfolderBase]: 64277/117005 cut-off events.
[2024-02-28 20:55:40,109 INFO  L125   PetriNetUnfolderBase]: For 2493958/2509654 co-relation queries the response was YES.
[2024-02-28 20:55:41,965 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 915507 conditions, 117005 events. 64277/117005 cut-off events. For 2493958/2509654 co-relation queries the response was YES. Maximal size of possible extension queue 3746. Compared 1171233 event pairs, 7300 based on Foata normal form. 556/117126 useless extension candidates. Maximal degree in co-relation 914361. Up to 74876 conditions per place. 
[2024-02-28 20:55:42,612 INFO  L140   encePairwiseOnDemand]: 78/121 looper letters, 3621 selfloop transitions, 1491 changer transitions 9/5194 dead transitions.
[2024-02-28 20:55:42,612 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 5194 transitions, 120414 flow
[2024-02-28 20:55:42,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2024-02-28 20:55:42,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2024-02-28 20:55:42,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2293 transitions.
[2024-02-28 20:55:42,615 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5264003673094583
[2024-02-28 20:55:42,615 INFO  L72            ComplementDD]: Start complementDD. Operand 36 states and 2293 transitions.
[2024-02-28 20:55:42,615 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 36 states and 2293 transitions.
[2024-02-28 20:55:42,616 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:55:42,616 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2293 transitions.
[2024-02-28 20:55:42,618 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 37 states, 36 states have (on average 63.69444444444444) internal successors, (2293), 36 states have internal predecessors, (2293), 0 states have call successors, (0), 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 20:55:42,621 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 37 states, 37 states have (on average 121.0) internal successors, (4477), 37 states have internal predecessors, (4477), 0 states have call successors, (0), 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 20:55:42,622 INFO  L81            ComplementDD]: Finished complementDD. Result  has 37 states, 37 states have (on average 121.0) internal successors, (4477), 37 states have internal predecessors, (4477), 0 states have call successors, (0), 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 20:55:42,622 INFO  L175             Difference]: Start difference. First operand has 379 places, 4019 transitions, 88528 flow. Second operand 36 states and 2293 transitions.
[2024-02-28 20:55:42,622 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 5194 transitions, 120414 flow
[2024-02-28 20:57:04,970 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 5194 transitions, 119283 flow, removed 298 selfloop flow, removed 35 redundant places.
[2024-02-28 20:57:05,055 INFO  L231             Difference]: Finished difference. Result has 390 places, 4399 transitions, 102517 flow
[2024-02-28 20:57:05,058 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=87551, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=102517, PETRI_PLACES=390, PETRI_TRANSITIONS=4399}
[2024-02-28 20:57:05,058 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 269 predicate places.
[2024-02-28 20:57:05,058 INFO  L495      AbstractCegarLoop]: Abstraction has has 390 places, 4399 transitions, 102517 flow
[2024-02-28 20:57:05,059 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 52.142857142857146) internal successors, (2190), 42 states have internal predecessors, (2190), 0 states have call successors, (0), 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 20:57:05,059 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:57:05,059 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:57:05,066 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-02-28 20:57:05,259 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-02-28 20:57:05,260 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:57:05,260 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:57:05,261 INFO  L85        PathProgramCache]: Analyzing trace with hash 1889188579, now seen corresponding path program 6 times
[2024-02-28 20:57:05,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:57:05,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208442342]
[2024-02-28 20:57:05,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:57:05,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:57:05,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:57:05,865 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 20:57:05,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:57:05,865 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208442342]
[2024-02-28 20:57:05,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208442342] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:57:05,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963053280]
[2024-02-28 20:57:05,866 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-02-28 20:57:05,866 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:57:05,866 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:57:05,867 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:57:05,869 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-02-28 20:57:06,000 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-02-28 20:57:06,001 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:57:06,002 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 68 conjunts are in the unsatisfiable core
[2024-02-28 20:57:06,007 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:57:06,103 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-02-28 20:57:06,133 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:57:06,133 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 17
[2024-02-28 20:57:06,224 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:57:06,237 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-02-28 20:57:06,237 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-02-28 20:57:06,508 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-02-28 20:57:06,509 INFO  L378             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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-02-28 20:57:06,728 INFO  L378             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 26 treesize of output 19
[2024-02-28 20:57:06,758 INFO  L378             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 11 treesize of output 7
[2024-02-28 20:57:06,824 INFO  L378             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 19 treesize of output 18
[2024-02-28 20:57:07,140 INFO  L378             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 20:57:07,199 INFO  L378             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 26 treesize of output 28
[2024-02-28 20:57:07,260 INFO  L378             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 21
[2024-02-28 20:57:07,280 INFO  L378             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 21
[2024-02-28 20:57:07,296 INFO  L378             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 21
[2024-02-28 20:57:07,314 INFO  L378             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 21
[2024-02-28 20:57:07,381 INFO  L378             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 33 treesize of output 38
[2024-02-28 20:57:07,460 INFO  L378             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 37 treesize of output 26
[2024-02-28 20:57:07,505 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 20:57:07,505 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:57:07,646 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1036 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1036 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-02-28 20:57:07,685 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false
[2024-02-28 20:57:07,737 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 20:57:07,757 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1033) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_1036) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 20:57:08,252 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:57:08,253 INFO  L378             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 55 treesize of output 65
[2024-02-28 20:57:08,257 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:57:08,258 INFO  L378             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 83 treesize of output 49
[2024-02-28 20:57:08,261 INFO  L378             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 15 treesize of output 11
[2024-02-28 20:57:08,265 INFO  L378             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 21 treesize of output 17
[2024-02-28 20:57:08,275 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:57:08,276 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:57:08,279 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-02-28 20:57:08,279 INFO  L378             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 30 treesize of output 1
[2024-02-28 20:57:08,281 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:57:08,281 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:57:08,285 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-02-28 20:57:08,285 INFO  L378             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 28 treesize of output 1
[2024-02-28 20:57:08,287 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:57:08,288 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:57:08,953 INFO  L378             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 52 treesize of output 40
[2024-02-28 20:57:08,959 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22
[2024-02-28 20:57:09,177 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 20:57:09,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [963053280] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:57:09,177 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:57:09,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 20] total 57
[2024-02-28 20:57:09,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557731361]
[2024-02-28 20:57:09,178 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:57:09,178 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 58 states
[2024-02-28 20:57:09,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:57:09,179 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants.
[2024-02-28 20:57:09,180 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2627, Unknown=29, NotChecked=428, Total=3306
[2024-02-28 20:57:09,350 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 34 out of 121
[2024-02-28 20:57:09,352 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 4399 transitions, 102517 flow. Second operand  has 58 states, 58 states have (on average 36.172413793103445) internal successors, (2098), 58 states have internal predecessors, (2098), 0 states have call successors, (0), 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 20:57:09,352 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:57:09,352 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 121
[2024-02-28 20:57:09,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:58:57,609 INFO  L124   PetriNetUnfolderBase]: 68170/123717 cut-off events.
[2024-02-28 20:58:57,609 INFO  L125   PetriNetUnfolderBase]: For 3043039/3043949 co-relation queries the response was YES.
[2024-02-28 20:58:59,797 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1012819 conditions, 123717 events. 68170/123717 cut-off events. For 3043039/3043949 co-relation queries the response was YES. Maximal size of possible extension queue 3825. Compared 1234993 event pairs, 7173 based on Foata normal form. 450/124016 useless extension candidates. Maximal degree in co-relation 1000864. Up to 79118 conditions per place. 
[2024-02-28 20:59:00,512 INFO  L140   encePairwiseOnDemand]: 67/121 looper letters, 3951 selfloop transitions, 1815 changer transitions 19/5821 dead transitions.
[2024-02-28 20:59:00,512 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 5821 transitions, 139330 flow
[2024-02-28 20:59:00,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. 
[2024-02-28 20:59:00,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2024-02-28 20:59:00,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 2532 transitions.
[2024-02-28 20:59:00,516 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3875114784205693
[2024-02-28 20:59:00,516 INFO  L72            ComplementDD]: Start complementDD. Operand 54 states and 2532 transitions.
[2024-02-28 20:59:00,516 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 54 states and 2532 transitions.
[2024-02-28 20:59:00,516 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:59:00,516 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 2532 transitions.
[2024-02-28 20:59:00,519 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 55 states, 54 states have (on average 46.888888888888886) internal successors, (2532), 54 states have internal predecessors, (2532), 0 states have call successors, (0), 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 20:59:00,524 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 55 states, 55 states have (on average 121.0) internal successors, (6655), 55 states have internal predecessors, (6655), 0 states have call successors, (0), 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 20:59:00,524 INFO  L81            ComplementDD]: Finished complementDD. Result  has 55 states, 55 states have (on average 121.0) internal successors, (6655), 55 states have internal predecessors, (6655), 0 states have call successors, (0), 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 20:59:00,524 INFO  L175             Difference]: Start difference. First operand has 390 places, 4399 transitions, 102517 flow. Second operand 54 states and 2532 transitions.
[2024-02-28 20:59:00,524 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 5821 transitions, 139330 flow
Killed by 15
