/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:34:06,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:34:06,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 03:34:06,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:34:06,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:34:06,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:34:06,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:34:06,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:34:06,724 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:34:06,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:34:06,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:34:06,725 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:34:06,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:34:06,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:34:06,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:34:06,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:34:06,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:34:06,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:34:06,726 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:34:06,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:34:06,727 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:34:06,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:34:06,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:34:06,728 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:34:06,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:34:06,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:34:06,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:34:06,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:34:06,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:34:06,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:34:06,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:34:06,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:34:06,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:34:06,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/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.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 03:34:06,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:34:06,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:34:06,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:34:06,949 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:34:06,950 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:34:06,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index.i [2023-11-30 03:34:07,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:34:08,274 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:34:08,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index.i [2023-11-30 03:34:08,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130788774/7b359595e09d420e8ade367d9b39f6cd/FLAGc38576032 [2023-11-30 03:34:08,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130788774/7b359595e09d420e8ade367d9b39f6cd [2023-11-30 03:34:08,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:34:08,308 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:34:08,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:34:08,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:34:08,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:34:08,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb7fef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08, skipping insertion in model container [2023-11-30 03:34:08,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,361 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:34:08,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:34:08,702 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:34:08,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:34:08,788 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:34:08,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08 WrapperNode [2023-11-30 03:34:08,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:34:08,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:34:08,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:34:08,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:34:08,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,832 INFO L138 Inliner]: procedures = 265, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2023-11-30 03:34:08,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:34:08,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:34:08,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:34:08,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:34:08,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:34:08,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:34:08,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:34:08,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:34:08,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (1/1) ... [2023-11-30 03:34:08,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:34:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:34:08,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 03:34:08,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 03:34:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:34:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-30 03:34:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:34:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-30 03:34:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:34:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:34:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:34:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-30 03:34:08,915 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-30 03:34:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:34:08,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:34:08,916 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 03:34:09,005 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:34:09,007 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:34:09,158 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:34:09,165 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:34:09,166 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 03:34:09,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:34:09 BoogieIcfgContainer [2023-11-30 03:34:09,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:34:09,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:34:09,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:34:09,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:34:09,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:34:08" (1/3) ... [2023-11-30 03:34:09,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57648275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:34:09, skipping insertion in model container [2023-11-30 03:34:09,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:34:08" (2/3) ... [2023-11-30 03:34:09,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57648275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:34:09, skipping insertion in model container [2023-11-30 03:34:09,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:34:09" (3/3) ... [2023-11-30 03:34:09,172 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-index.i [2023-11-30 03:34:09,183 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:34:09,184 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 03:34:09,184 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:34:09,222 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-30 03:34:09,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 237 flow [2023-11-30 03:34:09,384 INFO L124 PetriNetUnfolderBase]: 6/167 cut-off events. [2023-11-30 03:34:09,384 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 03:34:09,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 167 events. 6/167 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 82. Up to 4 conditions per place. [2023-11-30 03:34:09,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 115 transitions, 237 flow [2023-11-30 03:34:09,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 115 transitions, 237 flow [2023-11-30 03:34:09,406 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:34:09,410 INFO L362 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;@22e111e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:34:09,410 INFO L363 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-30 03:34:09,419 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:34:09,420 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-11-30 03:34:09,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:34:09,420 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:09,420 INFO L232 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] [2023-11-30 03:34:09,421 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:09,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:09,426 INFO L85 PathProgramCache]: Analyzing trace with hash 526870455, now seen corresponding path program 1 times [2023-11-30 03:34:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:09,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919197526] [2023-11-30 03:34:09,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:09,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:09,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:09,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919197526] [2023-11-30 03:34:09,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919197526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:09,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:09,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:34:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198193471] [2023-11-30 03:34:09,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:09,646 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:34:09,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:34:09,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:34:09,673 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 115 [2023-11-30 03:34:09,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:09,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:09,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 115 [2023-11-30 03:34:09,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:09,724 INFO L124 PetriNetUnfolderBase]: 13/217 cut-off events. [2023-11-30 03:34:09,724 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2023-11-30 03:34:09,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 217 events. 13/217 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 588 event pairs, 12 based on Foata normal form. 5/194 useless extension candidates. Maximal degree in co-relation 162. Up to 41 conditions per place. [2023-11-30 03:34:09,726 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 12 selfloop transitions, 2 changer transitions 1/111 dead transitions. [2023-11-30 03:34:09,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 111 transitions, 257 flow [2023-11-30 03:34:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:34:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:34:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-11-30 03:34:09,735 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2023-11-30 03:34:09,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-11-30 03:34:09,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-11-30 03:34:09,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:09,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-11-30 03:34:09,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:09,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:09,744 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:09,747 INFO L307 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2023-11-30 03:34:09,747 INFO L500 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 257 flow [2023-11-30 03:34:09,747 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:09,747 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:09,747 INFO L232 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] [2023-11-30 03:34:09,748 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:34:09,748 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:09,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1200329891, now seen corresponding path program 1 times [2023-11-30 03:34:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:09,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429659690] [2023-11-30 03:34:09,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:09,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:10,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:10,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429659690] [2023-11-30 03:34:10,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429659690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:10,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:10,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:10,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996864000] [2023-11-30 03:34:10,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:10,264 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:34:10,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:10,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:34:10,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:34:10,267 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 115 [2023-11-30 03:34:10,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:10,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 115 [2023-11-30 03:34:10,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:10,562 INFO L124 PetriNetUnfolderBase]: 295/992 cut-off events. [2023-11-30 03:34:10,562 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-30 03:34:10,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 992 events. 295/992 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6264 event pairs, 43 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 1579. Up to 428 conditions per place. [2023-11-30 03:34:10,573 INFO L140 encePairwiseOnDemand]: 92/115 looper letters, 69 selfloop transitions, 29 changer transitions 1/168 dead transitions. [2023-11-30 03:34:10,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 168 transitions, 572 flow [2023-11-30 03:34:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2023-11-30 03:34:10,575 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.763768115942029 [2023-11-30 03:34:10,575 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 527 transitions. [2023-11-30 03:34:10,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 527 transitions. [2023-11-30 03:34:10,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:10,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 527 transitions. [2023-11-30 03:34:10,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,579 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,580 INFO L307 CegarLoopForPetriNet]: 114 programPoint places, 6 predicate places. [2023-11-30 03:34:10,580 INFO L500 AbstractCegarLoop]: Abstraction has has 120 places, 168 transitions, 572 flow [2023-11-30 03:34:10,581 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,581 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:10,581 INFO L232 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] [2023-11-30 03:34:10,581 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:34:10,581 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:10,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1167023293, now seen corresponding path program 1 times [2023-11-30 03:34:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:10,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140241645] [2023-11-30 03:34:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:10,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:10,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:10,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140241645] [2023-11-30 03:34:10,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140241645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:10,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:10,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:34:10,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039570677] [2023-11-30 03:34:10,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:10,627 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:34:10,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:10,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:34:10,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:34:10,629 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2023-11-30 03:34:10,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 168 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:10,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2023-11-30 03:34:10,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:10,709 INFO L124 PetriNetUnfolderBase]: 289/990 cut-off events. [2023-11-30 03:34:10,711 INFO L125 PetriNetUnfolderBase]: For 47/53 co-relation queries the response was YES. [2023-11-30 03:34:10,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 990 events. 289/990 cut-off events. For 47/53 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6047 event pairs, 34 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 1556. Up to 428 conditions per place. [2023-11-30 03:34:10,715 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 9 selfloop transitions, 2 changer transitions 1/168 dead transitions. [2023-11-30 03:34:10,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 168 transitions, 594 flow [2023-11-30 03:34:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:34:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:34:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-11-30 03:34:10,720 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2023-11-30 03:34:10,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-11-30 03:34:10,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-11-30 03:34:10,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:10,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-11-30 03:34:10,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,723 INFO L307 CegarLoopForPetriNet]: 114 programPoint places, 6 predicate places. [2023-11-30 03:34:10,723 INFO L500 AbstractCegarLoop]: Abstraction has has 120 places, 168 transitions, 594 flow [2023-11-30 03:34:10,723 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,723 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:10,724 INFO L232 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] [2023-11-30 03:34:10,724 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:34:10,724 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:10,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1170767380, now seen corresponding path program 1 times [2023-11-30 03:34:10,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:10,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017753143] [2023-11-30 03:34:10,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:10,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:10,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:10,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017753143] [2023-11-30 03:34:10,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017753143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:10,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:10,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:10,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016475374] [2023-11-30 03:34:10,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:10,805 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 03:34:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:10,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 03:34:10,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 03:34:10,806 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 115 [2023-11-30 03:34:10,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 168 transitions, 594 flow. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:10,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 115 [2023-11-30 03:34:10,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:10,952 INFO L124 PetriNetUnfolderBase]: 289/983 cut-off events. [2023-11-30 03:34:10,952 INFO L125 PetriNetUnfolderBase]: For 107/119 co-relation queries the response was YES. [2023-11-30 03:34:10,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 983 events. 289/983 cut-off events. For 107/119 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6006 event pairs, 36 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 1666. Up to 429 conditions per place. [2023-11-30 03:34:10,955 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 35 selfloop transitions, 2 changer transitions 7/176 dead transitions. [2023-11-30 03:34:10,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 176 transitions, 700 flow [2023-11-30 03:34:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 541 transitions. [2023-11-30 03:34:10,956 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7840579710144927 [2023-11-30 03:34:10,956 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 541 transitions. [2023-11-30 03:34:10,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 541 transitions. [2023-11-30 03:34:10,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:10,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 541 transitions. [2023-11-30 03:34:10,958 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) [2023-11-30 03:34:10,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,959 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,960 INFO L307 CegarLoopForPetriNet]: 114 programPoint places, 11 predicate places. [2023-11-30 03:34:10,960 INFO L500 AbstractCegarLoop]: Abstraction has has 125 places, 176 transitions, 700 flow [2023-11-30 03:34:10,960 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:10,960 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:10,960 INFO L232 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] [2023-11-30 03:34:10,960 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:34:10,960 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:10,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:10,961 INFO L85 PathProgramCache]: Analyzing trace with hash 395297287, now seen corresponding path program 1 times [2023-11-30 03:34:10,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:10,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447648594] [2023-11-30 03:34:10,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:10,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447648594] [2023-11-30 03:34:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447648594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:11,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:11,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842777600] [2023-11-30 03:34:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:11,161 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:34:11,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:11,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:34:11,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:34:11,162 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 115 [2023-11-30 03:34:11,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 176 transitions, 700 flow. Second operand has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:11,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:11,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 115 [2023-11-30 03:34:11,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:11,496 INFO L124 PetriNetUnfolderBase]: 548/1620 cut-off events. [2023-11-30 03:34:11,496 INFO L125 PetriNetUnfolderBase]: For 257/284 co-relation queries the response was YES. [2023-11-30 03:34:11,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4218 conditions, 1620 events. 548/1620 cut-off events. For 257/284 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 11122 event pairs, 99 based on Foata normal form. 2/1475 useless extension candidates. Maximal degree in co-relation 3923. Up to 870 conditions per place. [2023-11-30 03:34:11,503 INFO L140 encePairwiseOnDemand]: 92/115 looper letters, 117 selfloop transitions, 90 changer transitions 23/306 dead transitions. [2023-11-30 03:34:11,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 306 transitions, 1718 flow [2023-11-30 03:34:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2023-11-30 03:34:11,505 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8449275362318841 [2023-11-30 03:34:11,505 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 583 transitions. [2023-11-30 03:34:11,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 583 transitions. [2023-11-30 03:34:11,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:11,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 583 transitions. [2023-11-30 03:34:11,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:11,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:11,507 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:11,508 INFO L307 CegarLoopForPetriNet]: 114 programPoint places, 16 predicate places. [2023-11-30 03:34:11,508 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 306 transitions, 1718 flow [2023-11-30 03:34:11,508 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:11,508 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:11,509 INFO L232 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] [2023-11-30 03:34:11,509 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:34:11,509 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-30 03:34:11,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash -554430641, now seen corresponding path program 1 times [2023-11-30 03:34:11,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:11,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369180228] [2023-11-30 03:34:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:11,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 03:34:11,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 03:34:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 03:34:11,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 03:34:11,562 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 03:34:11,562 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-11-30 03:34:11,564 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2023-11-30 03:34:11,564 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2023-11-30 03:34:11,564 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2023-11-30 03:34:11,564 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2023-11-30 03:34:11,564 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2023-11-30 03:34:11,564 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2023-11-30 03:34:11,564 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2023-11-30 03:34:11,564 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2023-11-30 03:34:11,564 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2023-11-30 03:34:11,565 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2023-11-30 03:34:11,565 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:34:11,565 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-30 03:34:11,566 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 03:34:11,567 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 03:34:11,582 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:34:11,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 136 transitions, 288 flow [2023-11-30 03:34:11,600 INFO L124 PetriNetUnfolderBase]: 11/295 cut-off events. [2023-11-30 03:34:11,600 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 03:34:11,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 295 events. 11/295 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 748 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 169. Up to 8 conditions per place. [2023-11-30 03:34:11,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 136 transitions, 288 flow [2023-11-30 03:34:11,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 136 transitions, 288 flow [2023-11-30 03:34:11,602 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:34:11,603 INFO L362 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;@22e111e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:34:11,603 INFO L363 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-30 03:34:11,604 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:34:11,604 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-11-30 03:34:11,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:34:11,604 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:11,604 INFO L232 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] [2023-11-30 03:34:11,605 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:34:11,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1704440759, now seen corresponding path program 1 times [2023-11-30 03:34:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:11,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347839183] [2023-11-30 03:34:11,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:11,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:11,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:11,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347839183] [2023-11-30 03:34:11,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347839183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:11,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:11,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:34:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014780502] [2023-11-30 03:34:11,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:11,620 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:34:11,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:34:11,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:34:11,621 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2023-11-30 03:34:11,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 136 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:11,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:11,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2023-11-30 03:34:11,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:11,715 INFO L124 PetriNetUnfolderBase]: 145/1088 cut-off events. [2023-11-30 03:34:11,715 INFO L125 PetriNetUnfolderBase]: For 76/169 co-relation queries the response was YES. [2023-11-30 03:34:11,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 1088 events. 145/1088 cut-off events. For 76/169 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6341 event pairs, 138 based on Foata normal form. 20/920 useless extension candidates. Maximal degree in co-relation 982. Up to 276 conditions per place. [2023-11-30 03:34:11,720 INFO L140 encePairwiseOnDemand]: 130/136 looper letters, 17 selfloop transitions, 2 changer transitions 1/132 dead transitions. [2023-11-30 03:34:11,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 132 transitions, 318 flow [2023-11-30 03:34:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:34:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:34:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-11-30 03:34:11,721 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8872549019607843 [2023-11-30 03:34:11,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-11-30 03:34:11,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-11-30 03:34:11,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:11,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-11-30 03:34:11,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:11,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:11,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:11,723 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 1 predicate places. [2023-11-30 03:34:11,723 INFO L500 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 318 flow [2023-11-30 03:34:11,724 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:11,724 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:11,724 INFO L232 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] [2023-11-30 03:34:11,724 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:34:11,724 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:34:11,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1599699293, now seen corresponding path program 1 times [2023-11-30 03:34:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:11,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203408089] [2023-11-30 03:34:11,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:11,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:11,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203408089] [2023-11-30 03:34:11,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203408089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:11,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:11,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707682920] [2023-11-30 03:34:11,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:11,855 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:34:11,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:11,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:34:11,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:34:11,856 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 136 [2023-11-30 03:34:11,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:11,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:11,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 136 [2023-11-30 03:34:11,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:13,272 INFO L124 PetriNetUnfolderBase]: 6939/15685 cut-off events. [2023-11-30 03:34:13,272 INFO L125 PetriNetUnfolderBase]: For 519/519 co-relation queries the response was YES. [2023-11-30 03:34:13,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28355 conditions, 15685 events. 6939/15685 cut-off events. For 519/519 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 145091 event pairs, 1581 based on Foata normal form. 0/13567 useless extension candidates. Maximal degree in co-relation 13460. Up to 8250 conditions per place. [2023-11-30 03:34:13,353 INFO L140 encePairwiseOnDemand]: 109/136 looper letters, 87 selfloop transitions, 48 changer transitions 1/218 dead transitions. [2023-11-30 03:34:13,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 218 transitions, 777 flow [2023-11-30 03:34:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2023-11-30 03:34:13,355 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7867647058823529 [2023-11-30 03:34:13,355 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2023-11-30 03:34:13,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2023-11-30 03:34:13,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:13,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2023-11-30 03:34:13,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:13,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:13,358 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:13,359 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 6 predicate places. [2023-11-30 03:34:13,359 INFO L500 AbstractCegarLoop]: Abstraction has has 142 places, 218 transitions, 777 flow [2023-11-30 03:34:13,359 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:13,359 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:13,359 INFO L232 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] [2023-11-30 03:34:13,360 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:34:13,360 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:34:13,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:13,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2013790288, now seen corresponding path program 1 times [2023-11-30 03:34:13,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:13,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441810827] [2023-11-30 03:34:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:13,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441810827] [2023-11-30 03:34:13,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441810827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:13,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:13,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:34:13,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895394355] [2023-11-30 03:34:13,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:13,385 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:34:13,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:13,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:34:13,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:34:13,386 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 136 [2023-11-30 03:34:13,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 218 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:13,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:13,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 136 [2023-11-30 03:34:13,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:14,490 INFO L124 PetriNetUnfolderBase]: 6452/14361 cut-off events. [2023-11-30 03:34:14,491 INFO L125 PetriNetUnfolderBase]: For 819/939 co-relation queries the response was YES. [2023-11-30 03:34:14,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26368 conditions, 14361 events. 6452/14361 cut-off events. For 819/939 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 128018 event pairs, 1357 based on Foata normal form. 0/12659 useless extension candidates. Maximal degree in co-relation 13374. Up to 7701 conditions per place. [2023-11-30 03:34:14,548 INFO L140 encePairwiseOnDemand]: 130/136 looper letters, 16 selfloop transitions, 3 changer transitions 1/219 dead transitions. [2023-11-30 03:34:14,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 219 transitions, 826 flow [2023-11-30 03:34:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:34:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:34:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-30 03:34:14,550 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9068627450980392 [2023-11-30 03:34:14,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-30 03:34:14,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-30 03:34:14,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:14,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-30 03:34:14,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:14,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:14,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:14,552 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 5 predicate places. [2023-11-30 03:34:14,552 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 219 transitions, 826 flow [2023-11-30 03:34:14,552 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:14,552 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:14,553 INFO L232 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] [2023-11-30 03:34:14,553 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:34:14,553 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:34:14,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:14,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1106786716, now seen corresponding path program 1 times [2023-11-30 03:34:14,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:14,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642415350] [2023-11-30 03:34:14,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:14,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:14,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:14,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642415350] [2023-11-30 03:34:14,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642415350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:14,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:14,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906225494] [2023-11-30 03:34:14,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:14,615 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 03:34:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:14,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 03:34:14,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 03:34:14,617 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 136 [2023-11-30 03:34:14,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 219 transitions, 826 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:14,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:14,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 136 [2023-11-30 03:34:14,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:15,704 INFO L124 PetriNetUnfolderBase]: 6452/14304 cut-off events. [2023-11-30 03:34:15,705 INFO L125 PetriNetUnfolderBase]: For 1603/1807 co-relation queries the response was YES. [2023-11-30 03:34:15,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27846 conditions, 14304 events. 6452/14304 cut-off events. For 1603/1807 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 126836 event pairs, 1367 based on Foata normal form. 0/12603 useless extension candidates. Maximal degree in co-relation 13230. Up to 7702 conditions per place. [2023-11-30 03:34:15,802 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 42 selfloop transitions, 2 changer transitions 7/229 dead transitions. [2023-11-30 03:34:15,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 229 transitions, 950 flow [2023-11-30 03:34:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 659 transitions. [2023-11-30 03:34:15,804 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8075980392156863 [2023-11-30 03:34:15,804 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 659 transitions. [2023-11-30 03:34:15,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 659 transitions. [2023-11-30 03:34:15,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:15,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 659 transitions. [2023-11-30 03:34:15,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:15,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:15,915 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:15,916 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 10 predicate places. [2023-11-30 03:34:15,916 INFO L500 AbstractCegarLoop]: Abstraction has has 146 places, 229 transitions, 950 flow [2023-11-30 03:34:15,916 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:15,916 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:15,917 INFO L232 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] [2023-11-30 03:34:15,917 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:34:15,917 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:34:15,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash 862203996, now seen corresponding path program 1 times [2023-11-30 03:34:15,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:15,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522224915] [2023-11-30 03:34:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:15,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:16,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522224915] [2023-11-30 03:34:16,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522224915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:16,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:16,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679141425] [2023-11-30 03:34:16,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:16,149 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:34:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:16,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:34:16,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:34:16,152 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 136 [2023-11-30 03:34:16,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 229 transitions, 950 flow. Second operand has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:16,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:16,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 136 [2023-11-30 03:34:16,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:19,196 INFO L124 PetriNetUnfolderBase]: 17587/35824 cut-off events. [2023-11-30 03:34:19,197 INFO L125 PetriNetUnfolderBase]: For 6173/6869 co-relation queries the response was YES. [2023-11-30 03:34:19,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92070 conditions, 35824 events. 17587/35824 cut-off events. For 6173/6869 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 353685 event pairs, 3344 based on Foata normal form. 62/31746 useless extension candidates. Maximal degree in co-relation 44513. Up to 18699 conditions per place. [2023-11-30 03:34:19,415 INFO L140 encePairwiseOnDemand]: 109/136 looper letters, 226 selfloop transitions, 159 changer transitions 7/484 dead transitions. [2023-11-30 03:34:19,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 484 transitions, 2915 flow [2023-11-30 03:34:19,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2023-11-30 03:34:19,417 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8725490196078431 [2023-11-30 03:34:19,417 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2023-11-30 03:34:19,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2023-11-30 03:34:19,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:19,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2023-11-30 03:34:19,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:19,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:19,419 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:19,420 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 15 predicate places. [2023-11-30 03:34:19,420 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 484 transitions, 2915 flow [2023-11-30 03:34:19,421 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:19,421 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:19,421 INFO L232 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] [2023-11-30 03:34:19,421 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:34:19,421 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:34:19,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash -28909326, now seen corresponding path program 1 times [2023-11-30 03:34:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:19,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995327524] [2023-11-30 03:34:19,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:19,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 03:34:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995327524] [2023-11-30 03:34:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995327524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:19,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:19,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:19,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573477855] [2023-11-30 03:34:19,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:19,642 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:34:19,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:19,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:34:19,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:34:19,643 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 136 [2023-11-30 03:34:19,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 484 transitions, 2915 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:19,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:19,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 136 [2023-11-30 03:34:19,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:24,031 INFO L124 PetriNetUnfolderBase]: 20565/41005 cut-off events. [2023-11-30 03:34:24,031 INFO L125 PetriNetUnfolderBase]: For 16705/19729 co-relation queries the response was YES. [2023-11-30 03:34:24,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132808 conditions, 41005 events. 20565/41005 cut-off events. For 16705/19729 co-relation queries the response was YES. Maximal size of possible extension queue 1289. Compared 401307 event pairs, 4658 based on Foata normal form. 64/36344 useless extension candidates. Maximal degree in co-relation 64540. Up to 25011 conditions per place. [2023-11-30 03:34:24,292 INFO L140 encePairwiseOnDemand]: 121/136 looper letters, 415 selfloop transitions, 142 changer transitions 15/672 dead transitions. [2023-11-30 03:34:24,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 672 transitions, 5243 flow [2023-11-30 03:34:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 599 transitions. [2023-11-30 03:34:24,296 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7340686274509803 [2023-11-30 03:34:24,296 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 599 transitions. [2023-11-30 03:34:24,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 599 transitions. [2023-11-30 03:34:24,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:24,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 599 transitions. [2023-11-30 03:34:24,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:24,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:24,298 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:24,299 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 20 predicate places. [2023-11-30 03:34:24,299 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 672 transitions, 5243 flow [2023-11-30 03:34:24,299 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:24,299 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:24,299 INFO L232 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:24,299 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:34:24,300 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:34:24,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1794159082, now seen corresponding path program 1 times [2023-11-30 03:34:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:24,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156133568] [2023-11-30 03:34:24,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:24,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-30 03:34:24,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:24,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156133568] [2023-11-30 03:34:24,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156133568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:24,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:24,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-30 03:34:24,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729228865] [2023-11-30 03:34:24,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:24,575 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 03:34:24,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:24,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 03:34:24,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-30 03:34:24,577 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 136 [2023-11-30 03:34:24,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 672 transitions, 5243 flow. Second operand has 10 states, 10 states have (on average 74.6) internal successors, (746), 10 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:24,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:24,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 136 [2023-11-30 03:34:24,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:31,085 INFO L124 PetriNetUnfolderBase]: 25908/50579 cut-off events. [2023-11-30 03:34:31,085 INFO L125 PetriNetUnfolderBase]: For 25530/31047 co-relation queries the response was YES. [2023-11-30 03:34:31,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207508 conditions, 50579 events. 25908/50579 cut-off events. For 25530/31047 co-relation queries the response was YES. Maximal size of possible extension queue 1741. Compared 497491 event pairs, 4403 based on Foata normal form. 376/45013 useless extension candidates. Maximal degree in co-relation 180387. Up to 32399 conditions per place. [2023-11-30 03:34:31,410 INFO L140 encePairwiseOnDemand]: 116/136 looper letters, 811 selfloop transitions, 265 changer transitions 18/1169 dead transitions. [2023-11-30 03:34:31,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 1169 transitions, 11234 flow [2023-11-30 03:34:31,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-30 03:34:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-30 03:34:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1055 transitions. [2023-11-30 03:34:31,415 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7052139037433155 [2023-11-30 03:34:31,415 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1055 transitions. [2023-11-30 03:34:31,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1055 transitions. [2023-11-30 03:34:31,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:31,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1055 transitions. [2023-11-30 03:34:31,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.9090909090909) internal successors, (1055), 11 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:31,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:31,420 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:31,421 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 30 predicate places. [2023-11-30 03:34:31,421 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 1169 transitions, 11234 flow [2023-11-30 03:34:31,421 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 74.6) internal successors, (746), 10 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:31,421 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:31,421 INFO L232 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:31,421 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:34:31,421 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:34:31,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash 131046167, now seen corresponding path program 1 times [2023-11-30 03:34:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:31,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535200415] [2023-11-30 03:34:31,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:31,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 03:34:31,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:31,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535200415] [2023-11-30 03:34:31,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535200415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:34:31,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63093105] [2023-11-30 03:34:31,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:31,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:34:31,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:34:31,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:34:31,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-30 03:34:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:31,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-30 03:34:31,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:34:31,983 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 [2023-11-30 03:34:32,007 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 [2023-11-30 03:34:32,032 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 [2023-11-30 03:34:32,068 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 [2023-11-30 03:34:32,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:34:32,111 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 [2023-11-30 03:34:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 03:34:32,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:34:32,154 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_376 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_376 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_376 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_376 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false [2023-11-30 03:34:32,167 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_ArrVal_376 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_376 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_376 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_376 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false [2023-11-30 03:34:32,180 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_376 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_376 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_376 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_376 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false [2023-11-30 03:34:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2023-11-30 03:34:32,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63093105] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:34:32,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:34:32,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-11-30 03:34:32,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48084609] [2023-11-30 03:34:32,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:34:32,262 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-30 03:34:32,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:32,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-30 03:34:32,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=301, Unknown=3, NotChecked=114, Total=506 [2023-11-30 03:34:32,264 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 136 [2023-11-30 03:34:32,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 1169 transitions, 11234 flow. Second operand has 23 states, 23 states have (on average 77.26086956521739) internal successors, (1777), 23 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:32,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:32,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 136 [2023-11-30 03:34:32,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:39,763 INFO L124 PetriNetUnfolderBase]: 24350/47983 cut-off events. [2023-11-30 03:34:39,763 INFO L125 PetriNetUnfolderBase]: For 35557/42428 co-relation queries the response was YES. [2023-11-30 03:34:39,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230916 conditions, 47983 events. 24350/47983 cut-off events. For 35557/42428 co-relation queries the response was YES. Maximal size of possible extension queue 1625. Compared 471543 event pairs, 4018 based on Foata normal form. 173/43410 useless extension candidates. Maximal degree in co-relation 204846. Up to 33332 conditions per place. [2023-11-30 03:34:40,161 INFO L140 encePairwiseOnDemand]: 120/136 looper letters, 1017 selfloop transitions, 18 changer transitions 23/1152 dead transitions. [2023-11-30 03:34:40,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1152 transitions, 13160 flow [2023-11-30 03:34:40,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 03:34:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 03:34:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 832 transitions. [2023-11-30 03:34:40,164 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.611764705882353 [2023-11-30 03:34:40,164 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 832 transitions. [2023-11-30 03:34:40,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 832 transitions. [2023-11-30 03:34:40,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:40,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 832 transitions. [2023-11-30 03:34:40,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.2) internal successors, (832), 10 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:40,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:40,167 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:40,167 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 36 predicate places. [2023-11-30 03:34:40,167 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 1152 transitions, 13160 flow [2023-11-30 03:34:40,168 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 77.26086956521739) internal successors, (1777), 23 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:40,168 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:40,168 INFO L232 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:40,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-30 03:34:40,375 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-30 03:34:40,376 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:34:40,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1353583908, now seen corresponding path program 1 times [2023-11-30 03:34:40,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:40,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210039998] [2023-11-30 03:34:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:40,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-30 03:34:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210039998] [2023-11-30 03:34:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210039998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:40,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:34:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:34:40,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158407701] [2023-11-30 03:34:40,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:40,560 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:34:40,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:40,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:34:40,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:34:40,561 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 136 [2023-11-30 03:34:40,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1152 transitions, 13160 flow. Second operand has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:40,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:40,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 136 [2023-11-30 03:34:40,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:34:53,962 INFO L124 PetriNetUnfolderBase]: 43132/82145 cut-off events. [2023-11-30 03:34:53,962 INFO L125 PetriNetUnfolderBase]: For 113595/129011 co-relation queries the response was YES. [2023-11-30 03:34:54,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431746 conditions, 82145 events. 43132/82145 cut-off events. For 113595/129011 co-relation queries the response was YES. Maximal size of possible extension queue 2857. Compared 847900 event pairs, 6960 based on Foata normal form. 130/74823 useless extension candidates. Maximal degree in co-relation 391276. Up to 52490 conditions per place. [2023-11-30 03:34:54,927 INFO L140 encePairwiseOnDemand]: 109/136 looper letters, 1303 selfloop transitions, 774 changer transitions 142/2370 dead transitions. [2023-11-30 03:34:54,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 2370 transitions, 32409 flow [2023-11-30 03:34:54,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:34:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:34:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions. [2023-11-30 03:34:54,936 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8492647058823529 [2023-11-30 03:34:54,936 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 693 transitions. [2023-11-30 03:34:54,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 693 transitions. [2023-11-30 03:34:54,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:34:54,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 693 transitions. [2023-11-30 03:34:54,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:54,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:54,945 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:54,945 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 41 predicate places. [2023-11-30 03:34:54,946 INFO L500 AbstractCegarLoop]: Abstraction has has 177 places, 2370 transitions, 32409 flow [2023-11-30 03:34:54,946 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:54,946 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:34:54,946 INFO L232 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:34:54,955 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:34:54,955 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:34:54,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:34:54,956 INFO L85 PathProgramCache]: Analyzing trace with hash -550349958, now seen corresponding path program 1 times [2023-11-30 03:34:54,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:34:54,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187594859] [2023-11-30 03:34:54,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:54,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:34:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:34:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:34:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187594859] [2023-11-30 03:34:55,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187594859] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:34:55,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84766059] [2023-11-30 03:34:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:34:55,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:34:55,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:34:55,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:34:55,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-30 03:34:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:34:55,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-30 03:34:55,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:34:55,549 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 [2023-11-30 03:34:55,595 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:34:55,596 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 [2023-11-30 03:34:55,715 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-30 03:34:55,715 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 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-30 03:34:55,759 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 [2023-11-30 03:34:55,778 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 15 treesize of output 11 [2023-11-30 03:34:55,785 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 28 treesize of output 27 [2023-11-30 03:34:55,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:34:55,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-30 03:34:55,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:34:55,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-30 03:34:55,838 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 56 treesize of output 45 [2023-11-30 03:34:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 03:34:55,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 03:34:55,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84766059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:34:55,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 03:34:55,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 20 [2023-11-30 03:34:55,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944080322] [2023-11-30 03:34:55,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:34:55,849 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 03:34:55,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:34:55,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 03:34:55,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-11-30 03:34:55,850 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 136 [2023-11-30 03:34:55,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 2370 transitions, 32409 flow. Second operand has 14 states, 14 states have (on average 67.57142857142857) internal successors, (946), 14 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:34:55,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:34:55,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 136 [2023-11-30 03:34:55,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:35:32,363 INFO L124 PetriNetUnfolderBase]: 67393/124324 cut-off events. [2023-11-30 03:35:32,363 INFO L125 PetriNetUnfolderBase]: For 235869/263938 co-relation queries the response was YES. [2023-11-30 03:35:32,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762224 conditions, 124324 events. 67393/124324 cut-off events. For 235869/263938 co-relation queries the response was YES. Maximal size of possible extension queue 4157. Compared 1306370 event pairs, 7424 based on Foata normal form. 478/113322 useless extension candidates. Maximal degree in co-relation 699856. Up to 81029 conditions per place. [2023-11-30 03:35:33,791 INFO L140 encePairwiseOnDemand]: 94/136 looper letters, 3453 selfloop transitions, 834 changer transitions 322/4679 dead transitions. [2023-11-30 03:35:33,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 4679 transitions, 74490 flow [2023-11-30 03:35:33,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-30 03:35:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-30 03:35:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1547 transitions. [2023-11-30 03:35:33,802 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5986842105263158 [2023-11-30 03:35:33,802 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1547 transitions. [2023-11-30 03:35:33,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1547 transitions. [2023-11-30 03:35:33,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:35:33,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1547 transitions. [2023-11-30 03:35:33,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 81.42105263157895) internal successors, (1547), 19 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:35:33,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:35:33,815 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:35:33,816 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 59 predicate places. [2023-11-30 03:35:33,816 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 4679 transitions, 74490 flow [2023-11-30 03:35:33,816 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 67.57142857142857) internal successors, (946), 14 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:35:33,816 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:35:33,816 INFO L232 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:35:33,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-30 03:35:34,020 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-30 03:35:34,020 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:35:34,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:35:34,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1567787764, now seen corresponding path program 2 times [2023-11-30 03:35:34,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:35:34,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101619891] [2023-11-30 03:35:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:35:34,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:35:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:35:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:35:34,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:35:34,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101619891] [2023-11-30 03:35:34,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101619891] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:35:34,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67431189] [2023-11-30 03:35:34,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 03:35:34,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:35:34,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:35:34,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:35:34,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-30 03:35:34,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:35:34,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:35:34,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-30 03:35:34,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:35:34,607 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 [2023-11-30 03:35:34,672 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:35:34,673 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 [2023-11-30 03:35:34,969 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-30 03:35:34,970 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 [2023-11-30 03:35:35,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:35:35,178 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 [2023-11-30 03:35:35,259 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 [2023-11-30 03:35:35,302 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 [2023-11-30 03:35:35,339 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 [2023-11-30 03:35:35,371 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 [2023-11-30 03:35:35,420 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 [2023-11-30 03:35:35,480 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 [2023-11-30 03:35:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:35:35,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:35:35,531 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_615 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_615 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_615 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_615 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))))) is different from false [2023-11-30 03:35:35,552 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_615 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_615 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_615 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_615 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))))))) is different from false [2023-11-30 03:35:35,567 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse1)) (.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_615 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_615 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_615 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_615 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_615) c_~datas~0.base) .cse3))))))) is different from false [2023-11-30 03:35:35,740 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (not (= (select (select (store (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_609) c_~datas~0.base v_ArrVal_610) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false [2023-11-30 03:35:35,769 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 (Array Int Int)) (v_ArrVal_610 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~malloc7#1.base| (select (select (store (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_609) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_610) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false [2023-11-30 03:35:35,833 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 [2023-11-30 03:35:35,837 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 50 [2023-11-30 03:35:35,839 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 50 treesize of output 46 [2023-11-30 03:35:35,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:35:35,904 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 [2023-11-30 03:35:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-30 03:35:35,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67431189] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:35:35,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:35:35,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 15] total 41 [2023-11-30 03:35:35,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916073168] [2023-11-30 03:35:35,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:35:35,930 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-30 03:35:35,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:35:35,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-30 03:35:35,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1155, Unknown=13, NotChecked=370, Total=1722 [2023-11-30 03:35:35,932 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 136 [2023-11-30 03:35:35,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 4679 transitions, 74490 flow. Second operand has 42 states, 42 states have (on average 60.57142857142857) internal successors, (2544), 42 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:35:35,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:35:35,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 136 [2023-11-30 03:35:35,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:36:57,075 INFO L124 PetriNetUnfolderBase]: 82319/151351 cut-off events. [2023-11-30 03:36:57,075 INFO L125 PetriNetUnfolderBase]: For 402328/450248 co-relation queries the response was YES. [2023-11-30 03:36:57,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039162 conditions, 151351 events. 82319/151351 cut-off events. For 402328/450248 co-relation queries the response was YES. Maximal size of possible extension queue 4613. Compared 1604992 event pairs, 7094 based on Foata normal form. 869/138001 useless extension candidates. Maximal degree in co-relation 328654. Up to 97747 conditions per place. [2023-11-30 03:36:58,935 INFO L140 encePairwiseOnDemand]: 106/136 looper letters, 6969 selfloop transitions, 1623 changer transitions 1007/9659 dead transitions. [2023-11-30 03:36:58,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 9659 transitions, 172799 flow [2023-11-30 03:36:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-30 03:36:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-11-30 03:36:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2883 transitions. [2023-11-30 03:36:58,954 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5170373027259685 [2023-11-30 03:36:58,954 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 2883 transitions. [2023-11-30 03:36:58,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 2883 transitions. [2023-11-30 03:36:58,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:36:58,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 2883 transitions. [2023-11-30 03:36:58,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 70.3170731707317) internal successors, (2883), 41 states have internal predecessors, (2883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:36:58,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 136.0) internal successors, (5712), 42 states have internal predecessors, (5712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:36:58,977 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 136.0) internal successors, (5712), 42 states have internal predecessors, (5712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:36:58,977 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 99 predicate places. [2023-11-30 03:36:58,978 INFO L500 AbstractCegarLoop]: Abstraction has has 235 places, 9659 transitions, 172799 flow [2023-11-30 03:36:58,978 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 60.57142857142857) internal successors, (2544), 42 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:36:58,978 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:36:58,978 INFO L232 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:36:59,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-30 03:36:59,183 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:36:59,184 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:36:59,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:36:59,184 INFO L85 PathProgramCache]: Analyzing trace with hash -653943372, now seen corresponding path program 3 times [2023-11-30 03:36:59,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:36:59,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419400723] [2023-11-30 03:36:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:36:59,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:36:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:36:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:36:59,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:36:59,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419400723] [2023-11-30 03:36:59,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419400723] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:36:59,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323802689] [2023-11-30 03:36:59,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 03:36:59,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:36:59,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:36:59,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:36:59,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-30 03:36:59,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-30 03:36:59,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:36:59,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-30 03:36:59,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:36:59,847 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 [2023-11-30 03:36:59,905 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:36:59,905 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 [2023-11-30 03:37:00,050 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-30 03:37:00,051 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 1 case distinctions, treesize of input 33 treesize of output 24 [2023-11-30 03:37:00,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:00,104 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 [2023-11-30 03:37:00,122 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 15 treesize of output 11 [2023-11-30 03:37:00,165 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 28 treesize of output 27 [2023-11-30 03:37:00,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:37:00,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-30 03:37:00,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:37:00,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-30 03:37:00,415 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 [2023-11-30 03:37:00,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:00,456 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 56 treesize of output 45 [2023-11-30 03:37:00,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:00,471 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 56 treesize of output 45 [2023-11-30 03:37:00,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:00,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 56 treesize of output 45 [2023-11-30 03:37:00,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:37:00,508 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 56 treesize of output 45 [2023-11-30 03:37:00,537 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 56 treesize of output 45 [2023-11-30 03:37:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:37:00,544 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 03:37:00,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323802689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:37:00,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 03:37:00,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2023-11-30 03:37:00,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124308454] [2023-11-30 03:37:00,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:37:00,545 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 03:37:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:37:00,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 03:37:00,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2023-11-30 03:37:00,547 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 136 [2023-11-30 03:37:00,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 9659 transitions, 172799 flow. Second operand has 15 states, 15 states have (on average 67.4) internal successors, (1011), 15 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:37:00,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:37:00,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 136 [2023-11-30 03:37:00,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:40:21,144 INFO L124 PetriNetUnfolderBase]: 84013/154394 cut-off events. [2023-11-30 03:40:21,144 INFO L125 PetriNetUnfolderBase]: For 482331/533038 co-relation queries the response was YES. [2023-11-30 03:40:21,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178242 conditions, 154394 events. 84013/154394 cut-off events. For 482331/533038 co-relation queries the response was YES. Maximal size of possible extension queue 4672. Compared 1637997 event pairs, 7174 based on Foata normal form. 1586/141428 useless extension candidates. Maximal degree in co-relation 382816. Up to 99497 conditions per place. [2023-11-30 03:40:22,973 INFO L140 encePairwiseOnDemand]: 108/136 looper letters, 6947 selfloop transitions, 2037 changer transitions 1207/10288 dead transitions. [2023-11-30 03:40:22,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 10288 transitions, 204008 flow [2023-11-30 03:40:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-30 03:40:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-30 03:40:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2048 transitions. [2023-11-30 03:40:22,976 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6023529411764705 [2023-11-30 03:40:22,976 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2048 transitions. [2023-11-30 03:40:22,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2048 transitions. [2023-11-30 03:40:22,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:40:22,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2048 transitions. [2023-11-30 03:40:22,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 81.92) internal successors, (2048), 25 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:40:22,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 136.0) internal successors, (3536), 26 states have internal predecessors, (3536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:40:22,982 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 136.0) internal successors, (3536), 26 states have internal predecessors, (3536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:40:22,982 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 123 predicate places. [2023-11-30 03:40:22,982 INFO L500 AbstractCegarLoop]: Abstraction has has 259 places, 10288 transitions, 204008 flow [2023-11-30 03:40:22,982 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 67.4) internal successors, (1011), 15 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:40:22,982 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:40:22,982 INFO L232 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:40:22,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-30 03:40:23,184 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-30 03:40:23,184 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:40:23,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:40:23,185 INFO L85 PathProgramCache]: Analyzing trace with hash 55336572, now seen corresponding path program 4 times [2023-11-30 03:40:23,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:40:23,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195619356] [2023-11-30 03:40:23,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:40:23,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:40:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:40:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:40:23,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:40:23,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195619356] [2023-11-30 03:40:23,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195619356] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:40:23,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528972561] [2023-11-30 03:40:23,679 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-30 03:40:23,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:40:23,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:40:23,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:40:23,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-30 03:40:23,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-30 03:40:23,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:40:23,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-30 03:40:23,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:40:23,874 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 [2023-11-30 03:40:23,939 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:40:23,939 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 [2023-11-30 03:40:24,200 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-30 03:40:24,200 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 [2023-11-30 03:40:24,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:24,373 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 [2023-11-30 03:40:24,408 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 [2023-11-30 03:40:24,451 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 [2023-11-30 03:40:24,503 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 [2023-11-30 03:40:24,643 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 [2023-11-30 03:40:24,682 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 [2023-11-30 03:40:24,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:24,724 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 [2023-11-30 03:40:24,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:24,754 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 [2023-11-30 03:40:24,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:24,772 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 [2023-11-30 03:40:24,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:40:24,789 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 [2023-11-30 03:40:24,846 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 [2023-11-30 03:40:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:40:25,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:40:25,063 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_815 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_815 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))))) is different from false [2023-11-30 03:40:29,402 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_815) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)))))))) is different from false [2023-11-30 03:40:29,426 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))))))) is different from false [2023-11-30 03:40:29,531 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse4 (+ c_~datas~0.offset 2 .cse2)) (.cse3 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-30 03:40:29,546 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset .cse4 1)) (.cse5 (+ c_~datas~0.offset 2 .cse4)) (.cse3 (+ c_~datas~0.offset 3 .cse4))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_814) .cse1 v_ArrVal_815) c_~datas~0.base) .cse5))))))) is different from false [2023-11-30 03:40:29,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:40:29,570 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 58 treesize of output 74 [2023-11-30 03:40:29,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:40:29,576 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 315 treesize of output 172 [2023-11-30 03:40:29,581 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 17 [2023-11-30 03:40:29,583 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 38 treesize of output 24 [2023-11-30 03:40:29,598 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-30 03:40:29,598 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 4 case distinctions, treesize of input 57 treesize of output 1 [2023-11-30 03:40:29,604 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-30 03:40:29,604 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 4 case distinctions, treesize of input 58 treesize of output 1 [2023-11-30 03:40:29,609 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-30 03:40:29,609 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 4 case distinctions, treesize of input 58 treesize of output 1 [2023-11-30 03:40:29,919 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 92 treesize of output 64 [2023-11-30 03:40:29,933 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 34 treesize of output 30 [2023-11-30 03:40:30,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:40:30,009 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 [2023-11-30 03:40:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-30 03:40:30,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528972561] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:40:30,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:40:30,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 15] total 44 [2023-11-30 03:40:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262541476] [2023-11-30 03:40:30,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:40:30,048 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-30 03:40:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:40:30,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-30 03:40:30,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1371, Unknown=26, NotChecked=400, Total=1980 [2023-11-30 03:40:30,050 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 136 [2023-11-30 03:40:30,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 10288 transitions, 204008 flow. Second operand has 45 states, 45 states have (on average 60.51111111111111) internal successors, (2723), 45 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:40:30,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:40:30,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 136 [2023-11-30 03:40:30,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:45:03,888 INFO L124 PetriNetUnfolderBase]: 87658/161495 cut-off events. [2023-11-30 03:45:03,888 INFO L125 PetriNetUnfolderBase]: For 553835/594946 co-relation queries the response was YES. [2023-11-30 03:45:04,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357363 conditions, 161495 events. 87658/161495 cut-off events. For 553835/594946 co-relation queries the response was YES. Maximal size of possible extension queue 4863. Compared 1723560 event pairs, 7429 based on Foata normal form. 1574/147885 useless extension candidates. Maximal degree in co-relation 787120. Up to 103456 conditions per place. [2023-11-30 03:45:06,013 INFO L140 encePairwiseOnDemand]: 102/136 looper letters, 7546 selfloop transitions, 2360 changer transitions 1591/11557 dead transitions. [2023-11-30 03:45:06,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 11557 transitions, 251920 flow [2023-11-30 03:45:06,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-30 03:45:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-11-30 03:45:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3627 transitions. [2023-11-30 03:45:06,016 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5229238754325259 [2023-11-30 03:45:06,016 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 3627 transitions. [2023-11-30 03:45:06,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 3627 transitions. [2023-11-30 03:45:06,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:45:06,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 3627 transitions. [2023-11-30 03:45:06,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 71.11764705882354) internal successors, (3627), 51 states have internal predecessors, (3627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:45:06,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 136.0) internal successors, (7072), 52 states have internal predecessors, (7072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:45:06,026 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 136.0) internal successors, (7072), 52 states have internal predecessors, (7072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:45:06,026 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 173 predicate places. [2023-11-30 03:45:06,026 INFO L500 AbstractCegarLoop]: Abstraction has has 309 places, 11557 transitions, 251920 flow [2023-11-30 03:45:06,027 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 60.51111111111111) internal successors, (2723), 45 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:45:06,027 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:45:06,027 INFO L232 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:45:06,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-30 03:45:06,232 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:45:06,233 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-30 03:45:06,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:45:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1855404630, now seen corresponding path program 5 times [2023-11-30 03:45:06,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:45:06,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47358854] [2023-11-30 03:45:06,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:45:06,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:45:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:45:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:45:06,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:45:06,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47358854] [2023-11-30 03:45:06,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47358854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:45:06,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680120899] [2023-11-30 03:45:06,750 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-30 03:45:06,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:45:06,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:45:06,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:45:06,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-30 03:45:06,871 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:45:06,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:45:06,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-30 03:45:06,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:45:06,891 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 [2023-11-30 03:45:06,948 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:45:06,949 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 [2023-11-30 03:45:07,275 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-30 03:45:07,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 [2023-11-30 03:45:07,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:07,342 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 [2023-11-30 03:45:07,389 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 15 treesize of output 11 [2023-11-30 03:45:07,424 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 28 treesize of output 27 [2023-11-30 03:45:07,465 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 [2023-11-30 03:45:07,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:45:07,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-30 03:45:07,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:45:07,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-30 03:45:07,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:07,603 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 56 treesize of output 45 [2023-11-30 03:45:07,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:07,618 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 56 treesize of output 45 [2023-11-30 03:45:07,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:07,638 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 56 treesize of output 45 [2023-11-30 03:45:07,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:45:07,654 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 56 treesize of output 45 [2023-11-30 03:45:07,686 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 56 treesize of output 45 [2023-11-30 03:45:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 03:45:07,694 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 03:45:07,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680120899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:45:07,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 03:45:07,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2023-11-30 03:45:07,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072677923] [2023-11-30 03:45:07,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:45:07,694 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 03:45:07,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:45:07,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 03:45:07,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2023-11-30 03:45:07,698 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 136 [2023-11-30 03:45:07,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 11557 transitions, 251920 flow. Second operand has 15 states, 15 states have (on average 67.4) internal successors, (1011), 15 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:45:07,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:45:07,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 136 [2023-11-30 03:45:07,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-30 03:47:39,399 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 03:47:39,399 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 03:47:39,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-30 03:47:39,673 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr1ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2023-11-30 03:47:39,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-30 03:47:39,878 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:47:39,879 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 65/136 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 605091 conditions, 65169 events (36124/65168 cut-off events. For 288032/321644 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 674450 event pairs, 4964 based on Foata normal form. 770/65690 useless extension candidates. Maximal degree in co-relation 316263. Up to 43867 conditions per place.). [2023-11-30 03:47:39,879 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2023-11-30 03:47:39,879 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2023-11-30 03:47:39,879 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2023-11-30 03:47:39,879 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2023-11-30 03:47:39,879 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2023-11-30 03:47:39,879 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2023-11-30 03:47:39,880 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-11-30 03:47:39,880 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2023-11-30 03:47:39,880 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2023-11-30 03:47:39,880 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2023-11-30 03:47:39,880 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2023-11-30 03:47:39,880 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2023-11-30 03:47:39,880 INFO L457 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:47:39,883 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-11-30 03:47:39,883 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:47:39,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:47:39 BasicIcfg [2023-11-30 03:47:39,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:47:39,886 INFO L158 Benchmark]: Toolchain (without parser) took 811577.61ms. Allocated memory was 362.8MB in the beginning and 14.0GB in the end (delta: 13.6GB). Free memory was 325.4MB in the beginning and 9.2GB in the end (delta: -8.8GB). Peak memory consumption was 5.7GB. Max. memory is 16.0GB. [2023-11-30 03:47:39,886 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 362.8MB. Free memory is still 318.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:47:39,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.79ms. Allocated memory is still 362.8MB. Free memory was 324.9MB in the beginning and 297.0MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-11-30 03:47:39,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.18ms. Allocated memory is still 362.8MB. Free memory was 297.0MB in the beginning and 294.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:47:39,886 INFO L158 Benchmark]: Boogie Preprocessor took 21.29ms. Allocated memory is still 362.8MB. Free memory was 294.4MB in the beginning and 292.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:47:39,886 INFO L158 Benchmark]: RCFGBuilder took 309.52ms. Allocated memory is still 362.8MB. Free memory was 292.3MB in the beginning and 274.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-11-30 03:47:39,887 INFO L158 Benchmark]: TraceAbstraction took 810717.53ms. Allocated memory was 362.8MB in the beginning and 14.0GB in the end (delta: 13.6GB). Free memory was 273.9MB in the beginning and 9.2GB in the end (delta: -8.9GB). Peak memory consumption was 5.7GB. Max. memory is 16.0GB. [2023-11-30 03:47:39,893 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 362.8MB. Free memory is still 318.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 478.79ms. Allocated memory is still 362.8MB. Free memory was 324.9MB in the beginning and 297.0MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.18ms. Allocated memory is still 362.8MB. Free memory was 297.0MB in the beginning and 294.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.29ms. Allocated memory is still 362.8MB. Free memory was 294.4MB in the beginning and 292.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 309.52ms. Allocated memory is still 362.8MB. Free memory was 292.3MB in the beginning and 274.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 810717.53ms. Allocated memory was 362.8MB in the beginning and 14.0GB in the end (delta: 13.6GB). Free memory was 273.9MB in the beginning and 9.2GB in the end (delta: -8.9GB). Peak memory consumption was 5.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 65/136 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 605091 conditions, 65169 events (36124/65168 cut-off events. For 288032/321644 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 674450 event pairs, 4964 based on Foata normal form. 770/65690 useless extension candidates. Maximal degree in co-relation 316263. Up to 43867 conditions per place.). - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 65/136 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 605091 conditions, 65169 events (36124/65168 cut-off events. For 288032/321644 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 674450 event pairs, 4964 based on Foata normal form. 770/65690 useless extension candidates. Maximal degree in co-relation 316263. Up to 43867 conditions per place.). - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 65/136 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 605091 conditions, 65169 events (36124/65168 cut-off events. For 288032/321644 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 674450 event pairs, 4964 based on Foata normal form. 770/65690 useless extension candidates. Maximal degree in co-relation 316263. Up to 43867 conditions per place.). - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 65/136 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 605091 conditions, 65169 events (36124/65168 cut-off events. For 288032/321644 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 674450 event pairs, 4964 based on Foata normal form. 770/65690 useless extension candidates. Maximal degree in co-relation 316263. Up to 43867 conditions per place.). - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 65/136 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 605091 conditions, 65169 events (36124/65168 cut-off events. For 288032/321644 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 674450 event pairs, 4964 based on Foata normal form. 770/65690 useless extension candidates. Maximal degree in co-relation 316263. Up to 43867 conditions per place.). - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 65/136 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 605091 conditions, 65169 events (36124/65168 cut-off events. For 288032/321644 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 674450 event pairs, 4964 based on Foata normal form. 770/65690 useless extension candidates. Maximal degree in co-relation 316263. Up to 43867 conditions per place.). - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 65/136 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 605091 conditions, 65169 events (36124/65168 cut-off events. For 288032/321644 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 674450 event pairs, 4964 based on Foata normal form. 770/65690 useless extension candidates. Maximal degree in co-relation 316263. Up to 43867 conditions per place.). - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 65/136 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 605091 conditions, 65169 events (36124/65168 cut-off events. For 288032/321644 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 674450 event pairs, 4964 based on Foata normal form. 770/65690 useless extension candidates. Maximal degree in co-relation 316263. Up to 43867 conditions per place.). - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (15states, 65/136 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 605091 conditions, 65169 events (36124/65168 cut-off events. For 288032/321644 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 674450 event pairs, 4964 based on Foata normal form. 770/65690 useless extension candidates. Maximal degree in co-relation 316263. Up to 43867 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 132 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 590 IncrementalHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 87 mSDtfsCounter, 590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1718occurred in iteration=5, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 808.3s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 792.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3595 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3595 mSDsluCounter, 2267 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5973 IncrementalHoareTripleChecker+Unchecked, 1823 mSDsCounter, 895 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15712 IncrementalHoareTripleChecker+Invalid, 22580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 895 mSolverCounterUnsat, 444 mSDtfsCounter, 15712 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 916 GetRequests, 542 SyntacticMatches, 24 SemanticMatches, 350 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 5271 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251920occurred in iteration=13, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 1200 NumberOfCodeBlocks, 1200 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1377 ConstructedInterpolants, 74 QuantifiedInterpolants, 20176 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1294 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 42/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown