/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/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:29:56,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:29:56,935 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:29:56,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:29:56,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:29:56,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:29:56,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:29:56,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:29:56,963 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:29:56,966 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:29:56,966 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:29:56,967 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:29:56,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:29:56,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:29:56,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:29:56,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:29:56,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:29:56,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:29:56,968 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:29:56,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:29:56,969 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:29:56,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:29:56,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:29:56,970 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:29:56,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:29:56,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:29:56,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:29:56,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:29:56,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:29:56,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:29:56,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:29:56,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:29:56,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:29:56,972 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:29:57,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:29:57,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:29:57,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:29:57,153 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:29:57,153 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:29:57,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2023-11-30 03:29:58,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:29:58,229 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:29:58,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2023-11-30 03:29:58,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995ad51d4/d45759fb7c884f7491db1450cf4eabd9/FLAGa22fc5c3e [2023-11-30 03:29:58,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995ad51d4/d45759fb7c884f7491db1450cf4eabd9 [2023-11-30 03:29:58,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:29:58,245 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:29:58,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:29:58,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:29:58,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:29:58,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:29:58" (1/1) ... [2023-11-30 03:29:58,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2b933b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58, skipping insertion in model container [2023-11-30 03:29:58,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:29:58" (1/1) ... [2023-11-30 03:29:58,265 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:29:58,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:29:58,392 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:29:58,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:29:58,422 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:29:58,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58 WrapperNode [2023-11-30 03:29:58,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:29:58,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:29:58,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:29:58,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:29:58,427 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:29:58" (1/1) ... [2023-11-30 03:29:58,435 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:29:58" (1/1) ... [2023-11-30 03:29:58,459 INFO L138 Inliner]: procedures = 24, calls = 35, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 286 [2023-11-30 03:29:58,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:29:58,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:29:58,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:29:58,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:29:58,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58" (1/1) ... [2023-11-30 03:29:58,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58" (1/1) ... [2023-11-30 03:29:58,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58" (1/1) ... [2023-11-30 03:29:58,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58" (1/1) ... [2023-11-30 03:29:58,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58" (1/1) ... [2023-11-30 03:29:58,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58" (1/1) ... [2023-11-30 03:29:58,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58" (1/1) ... [2023-11-30 03:29:58,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58" (1/1) ... [2023-11-30 03:29:58,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:29:58,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:29:58,496 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:29:58,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:29:58,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58" (1/1) ... [2023-11-30 03:29:58,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:29:58,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:29:58,538 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:29:58,555 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:29:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:29:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:29:58,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:29:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:29:58,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:29:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:29:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:29:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:29:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:29:58,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:29:58,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:29:58,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:29:58,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:29:58,577 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:29:58,672 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:29:58,674 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:29:58,977 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:29:58,994 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:29:58,994 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-30 03:29:58,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:29:58 BoogieIcfgContainer [2023-11-30 03:29:58,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:29:58,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:29:58,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:29:58,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:29:59,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:29:58" (1/3) ... [2023-11-30 03:29:59,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46487c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:29:59, skipping insertion in model container [2023-11-30 03:29:59,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:58" (2/3) ... [2023-11-30 03:29:59,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46487c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:29:59, skipping insertion in model container [2023-11-30 03:29:59,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:29:58" (3/3) ... [2023-11-30 03:29:59,001 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2023-11-30 03:29:59,015 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:29:59,016 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-30 03:29:59,016 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:29:59,135 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:29:59,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 369 transitions, 752 flow [2023-11-30 03:29:59,288 INFO L124 PetriNetUnfolderBase]: 19/367 cut-off events. [2023-11-30 03:29:59,288 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 03:29:59,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 367 events. 19/367 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 548 event pairs, 0 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 219. Up to 2 conditions per place. [2023-11-30 03:29:59,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 357 places, 369 transitions, 752 flow [2023-11-30 03:29:59,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 346 transitions, 704 flow [2023-11-30 03:29:59,318 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:29:59,324 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;@7148fb19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:29:59,326 INFO L363 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2023-11-30 03:29:59,331 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:29:59,332 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2023-11-30 03:29:59,332 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:29:59,332 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:59,332 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] [2023-11-30 03:29:59,333 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:29:59,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1049162128, now seen corresponding path program 1 times [2023-11-30 03:29:59,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:59,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027208515] [2023-11-30 03:29:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:59,480 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:29:59,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:59,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027208515] [2023-11-30 03:29:59,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027208515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:59,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:59,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:59,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944900971] [2023-11-30 03:29:59,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:59,490 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:59,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:59,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:59,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:59,524 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 369 [2023-11-30 03:29:59,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 346 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:29:59,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:59,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 369 [2023-11-30 03:29:59,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:59,703 INFO L124 PetriNetUnfolderBase]: 44/1020 cut-off events. [2023-11-30 03:29:59,703 INFO L125 PetriNetUnfolderBase]: For 22/39 co-relation queries the response was YES. [2023-11-30 03:29:59,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 1020 events. 44/1020 cut-off events. For 22/39 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4810 event pairs, 15 based on Foata normal form. 23/841 useless extension candidates. Maximal degree in co-relation 887. Up to 55 conditions per place. [2023-11-30 03:29:59,713 INFO L140 encePairwiseOnDemand]: 355/369 looper letters, 16 selfloop transitions, 2 changer transitions 4/334 dead transitions. [2023-11-30 03:29:59,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 334 transitions, 716 flow [2023-11-30 03:29:59,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2023-11-30 03:29:59,730 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9376693766937669 [2023-11-30 03:29:59,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1038 transitions. [2023-11-30 03:29:59,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1038 transitions. [2023-11-30 03:29:59,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:59,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1038 transitions. [2023-11-30 03:29:59,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 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:29:59,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:29:59,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:29:59,749 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 1 predicate places. [2023-11-30 03:29:59,750 INFO L500 AbstractCegarLoop]: Abstraction has has 336 places, 334 transitions, 716 flow [2023-11-30 03:29:59,751 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:29:59,751 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:59,751 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] [2023-11-30 03:29:59,751 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:29:59,752 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:29:59,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:59,752 INFO L85 PathProgramCache]: Analyzing trace with hash -819286939, now seen corresponding path program 1 times [2023-11-30 03:29:59,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:59,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862214004] [2023-11-30 03:29:59,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:59,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:59,805 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:29:59,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:59,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862214004] [2023-11-30 03:29:59,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862214004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:59,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:59,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290374372] [2023-11-30 03:29:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:59,808 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:59,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:59,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:59,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:59,810 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 369 [2023-11-30 03:29:59,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 334 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 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:29:59,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:59,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 369 [2023-11-30 03:29:59,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:00,013 INFO L124 PetriNetUnfolderBase]: 101/1535 cut-off events. [2023-11-30 03:30:00,013 INFO L125 PetriNetUnfolderBase]: For 147/164 co-relation queries the response was YES. [2023-11-30 03:30:00,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 1535 events. 101/1535 cut-off events. For 147/164 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 9246 event pairs, 54 based on Foata normal form. 0/1231 useless extension candidates. Maximal degree in co-relation 1548. Up to 146 conditions per place. [2023-11-30 03:30:00,023 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 25 selfloop transitions, 2 changer transitions 4/333 dead transitions. [2023-11-30 03:30:00,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 333 transitions, 768 flow [2023-11-30 03:30:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1009 transitions. [2023-11-30 03:30:00,025 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9114724480578139 [2023-11-30 03:30:00,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1009 transitions. [2023-11-30 03:30:00,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1009 transitions. [2023-11-30 03:30:00,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:00,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1009 transitions. [2023-11-30 03:30:00,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 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:30:00,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:00,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:00,030 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 2 predicate places. [2023-11-30 03:30:00,030 INFO L500 AbstractCegarLoop]: Abstraction has has 337 places, 333 transitions, 768 flow [2023-11-30 03:30:00,031 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 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:30:00,031 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:00,031 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] [2023-11-30 03:30:00,031 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:30:00,031 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:00,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:00,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1464593500, now seen corresponding path program 1 times [2023-11-30 03:30:00,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:00,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181901692] [2023-11-30 03:30:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:00,080 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:30:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:00,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181901692] [2023-11-30 03:30:00,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181901692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:00,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:00,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:00,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144939138] [2023-11-30 03:30:00,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:00,082 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:00,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:00,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:00,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:00,084 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 369 [2023-11-30 03:30:00,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 333 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 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:30:00,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:00,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 369 [2023-11-30 03:30:00,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:00,250 INFO L124 PetriNetUnfolderBase]: 77/1364 cut-off events. [2023-11-30 03:30:00,250 INFO L125 PetriNetUnfolderBase]: For 220/251 co-relation queries the response was YES. [2023-11-30 03:30:00,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 1364 events. 77/1364 cut-off events. For 220/251 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7679 event pairs, 35 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 1394. Up to 90 conditions per place. [2023-11-30 03:30:00,266 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 17 selfloop transitions, 1 changer transitions 4/327 dead transitions. [2023-11-30 03:30:00,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 327 transitions, 780 flow [2023-11-30 03:30:00,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2023-11-30 03:30:00,269 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9186991869918699 [2023-11-30 03:30:00,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1017 transitions. [2023-11-30 03:30:00,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1017 transitions. [2023-11-30 03:30:00,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:00,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1017 transitions. [2023-11-30 03:30:00,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 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:30:00,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:00,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:00,274 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, -2 predicate places. [2023-11-30 03:30:00,274 INFO L500 AbstractCegarLoop]: Abstraction has has 333 places, 327 transitions, 780 flow [2023-11-30 03:30:00,275 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 0 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:30:00,275 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:00,275 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, 1] [2023-11-30 03:30:00,275 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:30:00,276 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:00,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:00,277 INFO L85 PathProgramCache]: Analyzing trace with hash 975174286, now seen corresponding path program 1 times [2023-11-30 03:30:00,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:00,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573810137] [2023-11-30 03:30:00,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:00,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:00,754 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:30:00,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:00,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573810137] [2023-11-30 03:30:00,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573810137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:00,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:00,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:30:00,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441236530] [2023-11-30 03:30:00,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:00,756 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:30:00,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:00,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:30:00,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:30:00,762 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 369 [2023-11-30 03:30:00,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 327 transitions, 780 flow. Second operand has 6 states, 6 states have (on average 298.8333333333333) internal successors, (1793), 6 states have internal predecessors, (1793), 0 states have call successors, (0), 0 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:30:00,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:00,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 369 [2023-11-30 03:30:00,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:02,491 INFO L124 PetriNetUnfolderBase]: 3072/14760 cut-off events. [2023-11-30 03:30:02,491 INFO L125 PetriNetUnfolderBase]: For 1124/1413 co-relation queries the response was YES. [2023-11-30 03:30:02,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20831 conditions, 14760 events. 3072/14760 cut-off events. For 1124/1413 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 163482 event pairs, 2453 based on Foata normal form. 0/12092 useless extension candidates. Maximal degree in co-relation 20508. Up to 4354 conditions per place. [2023-11-30 03:30:02,581 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 53 selfloop transitions, 5 changer transitions 4/326 dead transitions. [2023-11-30 03:30:02,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 326 transitions, 894 flow [2023-11-30 03:30:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:30:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:30:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1841 transitions. [2023-11-30 03:30:02,585 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8315266485998193 [2023-11-30 03:30:02,585 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1841 transitions. [2023-11-30 03:30:02,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1841 transitions. [2023-11-30 03:30:02,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:02,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1841 transitions. [2023-11-30 03:30:02,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 306.8333333333333) internal successors, (1841), 6 states have internal predecessors, (1841), 0 states have call successors, (0), 0 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:30:02,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 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:30:02,592 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 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:30:02,593 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 2 predicate places. [2023-11-30 03:30:02,593 INFO L500 AbstractCegarLoop]: Abstraction has has 337 places, 326 transitions, 894 flow [2023-11-30 03:30:02,594 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.8333333333333) internal successors, (1793), 6 states have internal predecessors, (1793), 0 states have call successors, (0), 0 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:30:02,594 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:02,594 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, 1] [2023-11-30 03:30:02,594 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:30:02,594 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:02,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash -243879993, now seen corresponding path program 1 times [2023-11-30 03:30:02,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:02,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148508687] [2023-11-30 03:30:02,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:02,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:02,617 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:30:02,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148508687] [2023-11-30 03:30:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148508687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:02,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:02,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:02,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909468790] [2023-11-30 03:30:02,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:02,618 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:02,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:02,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:02,619 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 369 [2023-11-30 03:30:02,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 326 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 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:30:02,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:02,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 369 [2023-11-30 03:30:02,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:04,405 INFO L124 PetriNetUnfolderBase]: 3646/17622 cut-off events. [2023-11-30 03:30:04,405 INFO L125 PetriNetUnfolderBase]: For 2876/3423 co-relation queries the response was YES. [2023-11-30 03:30:04,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25875 conditions, 17622 events. 3646/17622 cut-off events. For 2876/3423 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 199808 event pairs, 3020 based on Foata normal form. 0/14382 useless extension candidates. Maximal degree in co-relation 25506. Up to 4991 conditions per place. [2023-11-30 03:30:04,503 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 19 selfloop transitions, 2 changer transitions 4/325 dead transitions. [2023-11-30 03:30:04,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 325 transitions, 934 flow [2023-11-30 03:30:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1021 transitions. [2023-11-30 03:30:04,506 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9223125564588979 [2023-11-30 03:30:04,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1021 transitions. [2023-11-30 03:30:04,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1021 transitions. [2023-11-30 03:30:04,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:04,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1021 transitions. [2023-11-30 03:30:04,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 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:30:04,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:04,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:04,512 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 3 predicate places. [2023-11-30 03:30:04,512 INFO L500 AbstractCegarLoop]: Abstraction has has 338 places, 325 transitions, 934 flow [2023-11-30 03:30:04,513 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 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:30:04,513 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:04,513 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, 1, 1, 1, 1, 1] [2023-11-30 03:30:04,513 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:30:04,513 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:04,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash -192549483, now seen corresponding path program 1 times [2023-11-30 03:30:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:04,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576668995] [2023-11-30 03:30:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:04,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:04,552 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:30:04,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:04,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576668995] [2023-11-30 03:30:04,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576668995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:04,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:04,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:04,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72233779] [2023-11-30 03:30:04,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:04,555 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:04,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:04,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:04,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:04,556 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 369 [2023-11-30 03:30:04,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 325 transitions, 934 flow. Second operand has 3 states, 3 states have (on average 341.3333333333333) internal successors, (1024), 3 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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:30:04,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:04,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 369 [2023-11-30 03:30:04,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:06,095 INFO L124 PetriNetUnfolderBase]: 3459/16473 cut-off events. [2023-11-30 03:30:06,096 INFO L125 PetriNetUnfolderBase]: For 4260/4903 co-relation queries the response was YES. [2023-11-30 03:30:06,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24506 conditions, 16473 events. 3459/16473 cut-off events. For 4260/4903 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 183788 event pairs, 2875 based on Foata normal form. 0/13501 useless extension candidates. Maximal degree in co-relation 24126. Up to 4748 conditions per place. [2023-11-30 03:30:06,173 INFO L140 encePairwiseOnDemand]: 365/369 looper letters, 11 selfloop transitions, 1 changer transitions 4/322 dead transitions. [2023-11-30 03:30:06,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 322 transitions, 946 flow [2023-11-30 03:30:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1035 transitions. [2023-11-30 03:30:06,175 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9349593495934959 [2023-11-30 03:30:06,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1035 transitions. [2023-11-30 03:30:06,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1035 transitions. [2023-11-30 03:30:06,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:06,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1035 transitions. [2023-11-30 03:30:06,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 345.0) internal successors, (1035), 3 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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:30:06,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:06,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:06,179 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 2 predicate places. [2023-11-30 03:30:06,180 INFO L500 AbstractCegarLoop]: Abstraction has has 337 places, 322 transitions, 946 flow [2023-11-30 03:30:06,180 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 341.3333333333333) internal successors, (1024), 3 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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:30:06,180 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:06,180 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, 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:30:06,180 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:30:06,180 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:06,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:06,181 INFO L85 PathProgramCache]: Analyzing trace with hash 558778842, now seen corresponding path program 1 times [2023-11-30 03:30:06,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:06,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185427261] [2023-11-30 03:30:06,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:06,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:06,219 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:30:06,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:06,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185427261] [2023-11-30 03:30:06,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185427261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:06,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:06,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:06,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343337249] [2023-11-30 03:30:06,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:06,223 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:06,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:06,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:06,225 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 369 [2023-11-30 03:30:06,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 322 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 338.0) internal successors, (1014), 3 states have internal predecessors, (1014), 0 states have call successors, (0), 0 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:30:06,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:06,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 369 [2023-11-30 03:30:06,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:07,767 INFO L124 PetriNetUnfolderBase]: 3468/16422 cut-off events. [2023-11-30 03:30:07,767 INFO L125 PetriNetUnfolderBase]: For 9209/10926 co-relation queries the response was YES. [2023-11-30 03:30:07,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24825 conditions, 16422 events. 3468/16422 cut-off events. For 9209/10926 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 183100 event pairs, 2867 based on Foata normal form. 39/13549 useless extension candidates. Maximal degree in co-relation 24331. Up to 4757 conditions per place. [2023-11-30 03:30:07,858 INFO L140 encePairwiseOnDemand]: 362/369 looper letters, 13 selfloop transitions, 3 changer transitions 4/319 dead transitions. [2023-11-30 03:30:07,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 319 transitions, 987 flow [2023-11-30 03:30:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1031 transitions. [2023-11-30 03:30:07,860 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.931345980126468 [2023-11-30 03:30:07,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1031 transitions. [2023-11-30 03:30:07,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1031 transitions. [2023-11-30 03:30:07,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:07,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1031 transitions. [2023-11-30 03:30:07,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 343.6666666666667) internal successors, (1031), 3 states have internal predecessors, (1031), 0 states have call successors, (0), 0 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:30:07,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:07,865 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:07,865 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 0 predicate places. [2023-11-30 03:30:07,865 INFO L500 AbstractCegarLoop]: Abstraction has has 335 places, 319 transitions, 987 flow [2023-11-30 03:30:07,866 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.0) internal successors, (1014), 3 states have internal predecessors, (1014), 0 states have call successors, (0), 0 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:30:07,866 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:07,866 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, 1, 1, 1, 1, 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:30:07,866 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:30:07,866 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:07,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:07,866 INFO L85 PathProgramCache]: Analyzing trace with hash -871323340, now seen corresponding path program 1 times [2023-11-30 03:30:07,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:07,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979337221] [2023-11-30 03:30:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:07,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:07,892 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:30:07,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979337221] [2023-11-30 03:30:07,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979337221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:07,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:07,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:07,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266870624] [2023-11-30 03:30:07,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:07,893 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:07,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:07,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:07,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:07,895 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 369 [2023-11-30 03:30:07,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 319 transitions, 987 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 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:30:07,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:07,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 369 [2023-11-30 03:30:07,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:09,453 INFO L124 PetriNetUnfolderBase]: 3501/15543 cut-off events. [2023-11-30 03:30:09,453 INFO L125 PetriNetUnfolderBase]: For 7451/8145 co-relation queries the response was YES. [2023-11-30 03:30:09,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26637 conditions, 15543 events. 3501/15543 cut-off events. For 7451/8145 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 168610 event pairs, 2849 based on Foata normal form. 3/13383 useless extension candidates. Maximal degree in co-relation 26117. Up to 4796 conditions per place. [2023-11-30 03:30:09,537 INFO L140 encePairwiseOnDemand]: 352/369 looper letters, 26 selfloop transitions, 6 changer transitions 9/310 dead transitions. [2023-11-30 03:30:09,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 310 transitions, 1054 flow [2023-11-30 03:30:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2023-11-30 03:30:09,540 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8870822041553749 [2023-11-30 03:30:09,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2023-11-30 03:30:09,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2023-11-30 03:30:09,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:09,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2023-11-30 03:30:09,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 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:30:09,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:09,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:09,544 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, -8 predicate places. [2023-11-30 03:30:09,544 INFO L500 AbstractCegarLoop]: Abstraction has has 327 places, 310 transitions, 1054 flow [2023-11-30 03:30:09,544 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 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:30:09,544 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:09,544 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, 1, 1, 1, 1, 1, 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:30:09,548 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:30:09,548 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:09,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash -419502029, now seen corresponding path program 1 times [2023-11-30 03:30:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898128355] [2023-11-30 03:30:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:09,937 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:30:09,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:09,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898128355] [2023-11-30 03:30:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898128355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:09,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:09,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:30:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624029147] [2023-11-30 03:30:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:09,939 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:30:09,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:09,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:30:09,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:30:09,941 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 369 [2023-11-30 03:30:09,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 310 transitions, 1054 flow. Second operand has 6 states, 6 states have (on average 304.8333333333333) internal successors, (1829), 6 states have internal predecessors, (1829), 0 states have call successors, (0), 0 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:30:09,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:09,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 369 [2023-11-30 03:30:09,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:11,028 INFO L124 PetriNetUnfolderBase]: 2941/8039 cut-off events. [2023-11-30 03:30:11,028 INFO L125 PetriNetUnfolderBase]: For 15706/20265 co-relation queries the response was YES. [2023-11-30 03:30:11,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19842 conditions, 8039 events. 2941/8039 cut-off events. For 15706/20265 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 65053 event pairs, 700 based on Foata normal form. 189/7261 useless extension candidates. Maximal degree in co-relation 19282. Up to 4531 conditions per place. [2023-11-30 03:30:11,081 INFO L140 encePairwiseOnDemand]: 364/369 looper letters, 141 selfloop transitions, 4 changer transitions 9/405 dead transitions. [2023-11-30 03:30:11,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 405 transitions, 1726 flow [2023-11-30 03:30:11,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:30:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:30:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1963 transitions. [2023-11-30 03:30:11,085 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8866305329719963 [2023-11-30 03:30:11,085 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1963 transitions. [2023-11-30 03:30:11,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1963 transitions. [2023-11-30 03:30:11,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:11,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1963 transitions. [2023-11-30 03:30:11,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 327.1666666666667) internal successors, (1963), 6 states have internal predecessors, (1963), 0 states have call successors, (0), 0 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:30:11,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 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:30:11,092 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 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:30:11,093 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, -4 predicate places. [2023-11-30 03:30:11,093 INFO L500 AbstractCegarLoop]: Abstraction has has 331 places, 405 transitions, 1726 flow [2023-11-30 03:30:11,094 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.8333333333333) internal successors, (1829), 6 states have internal predecessors, (1829), 0 states have call successors, (0), 0 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:30:11,094 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:11,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:11,094 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:30:11,095 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:11,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1654139340, now seen corresponding path program 1 times [2023-11-30 03:30:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:11,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587215870] [2023-11-30 03:30:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:11,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:11,133 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:30:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:11,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587215870] [2023-11-30 03:30:11,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587215870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:11,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:11,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027811498] [2023-11-30 03:30:11,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:11,134 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:11,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:11,137 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 369 [2023-11-30 03:30:11,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 405 transitions, 1726 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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:30:11,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:11,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 369 [2023-11-30 03:30:11,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:12,474 INFO L124 PetriNetUnfolderBase]: 3192/12898 cut-off events. [2023-11-30 03:30:12,474 INFO L125 PetriNetUnfolderBase]: For 10281/14085 co-relation queries the response was YES. [2023-11-30 03:30:12,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27705 conditions, 12898 events. 3192/12898 cut-off events. For 10281/14085 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 127232 event pairs, 957 based on Foata normal form. 1/11563 useless extension candidates. Maximal degree in co-relation 26968. Up to 4463 conditions per place. [2023-11-30 03:30:12,552 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 19 selfloop transitions, 2 changer transitions 10/408 dead transitions. [2023-11-30 03:30:12,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 408 transitions, 1879 flow [2023-11-30 03:30:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1034 transitions. [2023-11-30 03:30:12,554 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.934056007226739 [2023-11-30 03:30:12,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1034 transitions. [2023-11-30 03:30:12,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1034 transitions. [2023-11-30 03:30:12,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:12,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1034 transitions. [2023-11-30 03:30:12,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 344.6666666666667) internal successors, (1034), 3 states have internal predecessors, (1034), 0 states have call successors, (0), 0 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:30:12,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:12,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:12,558 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, -6 predicate places. [2023-11-30 03:30:12,559 INFO L500 AbstractCegarLoop]: Abstraction has has 329 places, 408 transitions, 1879 flow [2023-11-30 03:30:12,559 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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:30:12,559 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:12,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:12,559 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:30:12,559 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:12,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:12,560 INFO L85 PathProgramCache]: Analyzing trace with hash 273658482, now seen corresponding path program 1 times [2023-11-30 03:30:12,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:12,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726128942] [2023-11-30 03:30:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:12,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:12,610 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:30:12,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:12,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726128942] [2023-11-30 03:30:12,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726128942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:12,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:12,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 03:30:12,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284332733] [2023-11-30 03:30:12,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:12,611 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 03:30:12,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:12,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 03:30:12,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 03:30:12,612 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 369 [2023-11-30 03:30:12,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 408 transitions, 1879 flow. Second operand has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 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:30:12,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:12,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 369 [2023-11-30 03:30:12,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:15,686 INFO L124 PetriNetUnfolderBase]: 6076/23722 cut-off events. [2023-11-30 03:30:15,686 INFO L125 PetriNetUnfolderBase]: For 21827/29126 co-relation queries the response was YES. [2023-11-30 03:30:15,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53527 conditions, 23722 events. 6076/23722 cut-off events. For 21827/29126 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 253200 event pairs, 1920 based on Foata normal form. 138/21369 useless extension candidates. Maximal degree in co-relation 52360. Up to 8392 conditions per place. [2023-11-30 03:30:15,972 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 84 selfloop transitions, 6 changer transitions 11/451 dead transitions. [2023-11-30 03:30:15,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 451 transitions, 2409 flow [2023-11-30 03:30:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 03:30:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 03:30:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1718 transitions. [2023-11-30 03:30:15,975 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9311653116531166 [2023-11-30 03:30:15,975 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1718 transitions. [2023-11-30 03:30:15,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1718 transitions. [2023-11-30 03:30:15,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:15,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1718 transitions. [2023-11-30 03:30:15,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 343.6) internal successors, (1718), 5 states have internal predecessors, (1718), 0 states have call successors, (0), 0 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:30:15,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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:30:15,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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:30:15,981 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, -2 predicate places. [2023-11-30 03:30:15,981 INFO L500 AbstractCegarLoop]: Abstraction has has 333 places, 451 transitions, 2409 flow [2023-11-30 03:30:15,981 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 339.0) internal successors, (1356), 4 states have internal predecessors, (1356), 0 states have call successors, (0), 0 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:30:15,981 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:15,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:15,981 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:30:15,981 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:15,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1774773332, now seen corresponding path program 1 times [2023-11-30 03:30:15,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:15,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913458821] [2023-11-30 03:30:15,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:15,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:16,232 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:30:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913458821] [2023-11-30 03:30:16,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913458821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:16,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:16,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:30:16,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123486724] [2023-11-30 03:30:16,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:16,234 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:30:16,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:16,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:30:16,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:30:16,235 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 369 [2023-11-30 03:30:16,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 451 transitions, 2409 flow. Second operand has 6 states, 6 states have (on average 305.8333333333333) internal successors, (1835), 6 states have internal predecessors, (1835), 0 states have call successors, (0), 0 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:30:16,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:16,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 369 [2023-11-30 03:30:16,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:19,604 INFO L124 PetriNetUnfolderBase]: 6070/23282 cut-off events. [2023-11-30 03:30:19,604 INFO L125 PetriNetUnfolderBase]: For 28119/41002 co-relation queries the response was YES. [2023-11-30 03:30:19,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61252 conditions, 23282 events. 6070/23282 cut-off events. For 28119/41002 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 245841 event pairs, 1746 based on Foata normal form. 5/20889 useless extension candidates. Maximal degree in co-relation 59853. Up to 8360 conditions per place. [2023-11-30 03:30:19,894 INFO L140 encePairwiseOnDemand]: 364/369 looper letters, 251 selfloop transitions, 4 changer transitions 11/522 dead transitions. [2023-11-30 03:30:19,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 522 transitions, 3351 flow [2023-11-30 03:30:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:30:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:30:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1938 transitions. [2023-11-30 03:30:19,902 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8753387533875339 [2023-11-30 03:30:19,902 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1938 transitions. [2023-11-30 03:30:19,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1938 transitions. [2023-11-30 03:30:19,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:19,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1938 transitions. [2023-11-30 03:30:19,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 0 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:30:19,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 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:30:19,908 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 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:30:19,909 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 2 predicate places. [2023-11-30 03:30:19,909 INFO L500 AbstractCegarLoop]: Abstraction has has 337 places, 522 transitions, 3351 flow [2023-11-30 03:30:19,909 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 305.8333333333333) internal successors, (1835), 6 states have internal predecessors, (1835), 0 states have call successors, (0), 0 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:30:19,909 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:19,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:19,910 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:30:19,910 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:19,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1358982555, now seen corresponding path program 1 times [2023-11-30 03:30:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362248680] [2023-11-30 03:30:19,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:20,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:30:20,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:20,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362248680] [2023-11-30 03:30:20,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362248680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:20,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:20,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:30:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534439331] [2023-11-30 03:30:20,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:20,161 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:30:20,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:20,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:30:20,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:30:20,164 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 369 [2023-11-30 03:30:20,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 522 transitions, 3351 flow. Second operand has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:30:20,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:20,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 369 [2023-11-30 03:30:20,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:23,193 INFO L124 PetriNetUnfolderBase]: 8116/18764 cut-off events. [2023-11-30 03:30:23,193 INFO L125 PetriNetUnfolderBase]: For 34820/48122 co-relation queries the response was YES. [2023-11-30 03:30:23,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70146 conditions, 18764 events. 8116/18764 cut-off events. For 34820/48122 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 160432 event pairs, 2120 based on Foata normal form. 1/16627 useless extension candidates. Maximal degree in co-relation 68704. Up to 9511 conditions per place. [2023-11-30 03:30:23,350 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 613 selfloop transitions, 42 changer transitions 11/912 dead transitions. [2023-11-30 03:30:23,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 912 transitions, 7863 flow [2023-11-30 03:30:23,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:30:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:30:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1955 transitions. [2023-11-30 03:30:23,363 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8830171635049684 [2023-11-30 03:30:23,363 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1955 transitions. [2023-11-30 03:30:23,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1955 transitions. [2023-11-30 03:30:23,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:23,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1955 transitions. [2023-11-30 03:30:23,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 325.8333333333333) internal successors, (1955), 6 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:30:23,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 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:30:23,368 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 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:30:23,369 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 6 predicate places. [2023-11-30 03:30:23,369 INFO L500 AbstractCegarLoop]: Abstraction has has 341 places, 912 transitions, 7863 flow [2023-11-30 03:30:23,370 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:30:23,370 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:23,370 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:23,370 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:30:23,370 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:23,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1796452143, now seen corresponding path program 1 times [2023-11-30 03:30:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:23,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862368683] [2023-11-30 03:30:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:23,418 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:30:23,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:23,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862368683] [2023-11-30 03:30:23,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862368683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:23,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:23,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 03:30:23,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922680146] [2023-11-30 03:30:23,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:23,419 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 03:30:23,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:23,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 03:30:23,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 03:30:23,420 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 369 [2023-11-30 03:30:23,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 912 transitions, 7863 flow. Second operand has 4 states, 4 states have (on average 319.25) internal successors, (1277), 4 states have internal predecessors, (1277), 0 states have call successors, (0), 0 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:30:23,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:23,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 369 [2023-11-30 03:30:23,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:27,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][272], [395#true, 406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 364#true, 4#L51-1true, 427#true, 404#(= |#race~f~0| 0), 420#true, 241#L64-1true, 389#(= |#race~x1~0| 0), 372#true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0), 202#L86-4true]) [2023-11-30 03:30:27,736 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-30 03:30:27,736 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2023-11-30 03:30:27,736 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 03:30:27,736 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-30 03:30:27,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][272], [395#true, 406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 364#true, 4#L51-1true, 427#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 372#true, 360#true, 413#true, 222#L64-2true, 393#(= |#race~x2~0| 0), 379#true, 202#L86-4true]) [2023-11-30 03:30:27,739 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2023-11-30 03:30:27,739 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 03:30:27,739 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2023-11-30 03:30:27,739 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-30 03:30:27,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][272], [406#true, 395#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 364#true, 4#L51-1true, 179#L87-1true, 427#true, 420#true, 241#L64-1true, 404#(= |#race~f~0| 0), 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:27,742 INFO L294 olderBase$Statistics]: this new event has 298 ancestors and is cut-off event [2023-11-30 03:30:27,742 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-30 03:30:27,742 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-30 03:30:27,742 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-30 03:30:27,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][272], [406#true, 395#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 364#true, 4#L51-1true, 179#L87-1true, 427#true, 420#true, 404#(= |#race~f~0| 0), 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0), 222#L64-2true]) [2023-11-30 03:30:27,743 INFO L294 olderBase$Statistics]: this new event has 299 ancestors and is cut-off event [2023-11-30 03:30:27,743 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 03:30:27,743 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2023-11-30 03:30:27,743 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-30 03:30:27,748 INFO L124 PetriNetUnfolderBase]: 10681/24454 cut-off events. [2023-11-30 03:30:27,749 INFO L125 PetriNetUnfolderBase]: For 71626/87146 co-relation queries the response was YES. [2023-11-30 03:30:27,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99542 conditions, 24454 events. 10681/24454 cut-off events. For 71626/87146 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 208720 event pairs, 2818 based on Foata normal form. 17/21823 useless extension candidates. Maximal degree in co-relation 98020. Up to 12746 conditions per place. [2023-11-30 03:30:27,983 INFO L140 encePairwiseOnDemand]: 363/369 looper letters, 759 selfloop transitions, 6 changer transitions 12/1105 dead transitions. [2023-11-30 03:30:27,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 1105 transitions, 11421 flow [2023-11-30 03:30:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 03:30:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 03:30:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1637 transitions. [2023-11-30 03:30:27,986 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8872628726287263 [2023-11-30 03:30:27,986 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1637 transitions. [2023-11-30 03:30:27,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1637 transitions. [2023-11-30 03:30:27,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:27,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1637 transitions. [2023-11-30 03:30:27,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 327.4) internal successors, (1637), 5 states have internal predecessors, (1637), 0 states have call successors, (0), 0 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:30:27,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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:30:27,990 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 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:30:27,991 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 10 predicate places. [2023-11-30 03:30:27,991 INFO L500 AbstractCegarLoop]: Abstraction has has 345 places, 1105 transitions, 11421 flow [2023-11-30 03:30:27,991 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 319.25) internal successors, (1277), 4 states have internal predecessors, (1277), 0 states have call successors, (0), 0 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:30:27,991 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:27,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:27,991 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:30:27,991 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:27,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash 672717544, now seen corresponding path program 1 times [2023-11-30 03:30:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:27,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597314271] [2023-11-30 03:30:27,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:27,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:28,014 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:30:28,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:28,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597314271] [2023-11-30 03:30:28,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597314271] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:28,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:28,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:28,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853332211] [2023-11-30 03:30:28,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:28,015 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:28,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:28,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:28,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:28,016 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 369 [2023-11-30 03:30:28,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 1105 transitions, 11421 flow. Second operand has 3 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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:30:28,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:28,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 369 [2023-11-30 03:30:28,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:32,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][271], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 434#true, 364#true, 4#L51-1true, 427#true, 420#true, 241#L64-1true, 404#(= |#race~f~0| 0), 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 202#L86-4true]) [2023-11-30 03:30:32,125 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-30 03:30:32,125 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2023-11-30 03:30:32,125 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 03:30:32,125 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-30 03:30:32,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][271], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 434#true, 364#true, 4#L51-1true, 427#true, 420#true, 404#(= |#race~f~0| 0), 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 393#(= |#race~x2~0| 0), 222#L64-2true, 379#true, 202#L86-4true]) [2023-11-30 03:30:32,127 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2023-11-30 03:30:32,127 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2023-11-30 03:30:32,127 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 03:30:32,127 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-30 03:30:32,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][271], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 434#true, 364#true, 4#L51-1true, 427#true, 179#L87-1true, 404#(= |#race~f~0| 0), 420#true, 241#L64-1true, 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:32,130 INFO L294 olderBase$Statistics]: this new event has 298 ancestors and is cut-off event [2023-11-30 03:30:32,130 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-30 03:30:32,130 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-30 03:30:32,130 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-30 03:30:32,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][271], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 434#true, 364#true, 4#L51-1true, 427#true, 179#L87-1true, 404#(= |#race~f~0| 0), 420#true, 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 222#L64-2true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:32,131 INFO L294 olderBase$Statistics]: this new event has 299 ancestors and is cut-off event [2023-11-30 03:30:32,131 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2023-11-30 03:30:32,131 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 03:30:32,131 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-30 03:30:32,136 INFO L124 PetriNetUnfolderBase]: 10682/24434 cut-off events. [2023-11-30 03:30:32,136 INFO L125 PetriNetUnfolderBase]: For 134921/174391 co-relation queries the response was YES. [2023-11-30 03:30:32,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100277 conditions, 24434 events. 10682/24434 cut-off events. For 134921/174391 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 208454 event pairs, 2818 based on Foata normal form. 3/21810 useless extension candidates. Maximal degree in co-relation 98650. Up to 12747 conditions per place. [2023-11-30 03:30:32,337 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 38 selfloop transitions, 2 changer transitions 12/1105 dead transitions. [2023-11-30 03:30:32,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1105 transitions, 11542 flow [2023-11-30 03:30:32,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1023 transitions. [2023-11-30 03:30:32,339 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.924119241192412 [2023-11-30 03:30:32,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1023 transitions. [2023-11-30 03:30:32,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1023 transitions. [2023-11-30 03:30:32,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:32,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1023 transitions. [2023-11-30 03:30:32,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 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:30:32,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:32,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:32,342 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 11 predicate places. [2023-11-30 03:30:32,343 INFO L500 AbstractCegarLoop]: Abstraction has has 346 places, 1105 transitions, 11542 flow [2023-11-30 03:30:32,343 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 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:30:32,343 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:32,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:32,343 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:30:32,343 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:32,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:32,343 INFO L85 PathProgramCache]: Analyzing trace with hash -520231361, now seen corresponding path program 1 times [2023-11-30 03:30:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:32,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471087560] [2023-11-30 03:30:32,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:32,672 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:30:32,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:32,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471087560] [2023-11-30 03:30:32,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471087560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:32,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:32,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:30:32,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022153162] [2023-11-30 03:30:32,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:32,675 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:30:32,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:32,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:30:32,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:30:32,676 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 369 [2023-11-30 03:30:32,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 1105 transitions, 11542 flow. Second operand has 6 states, 6 states have (on average 295.1666666666667) internal successors, (1771), 6 states have internal predecessors, (1771), 0 states have call successors, (0), 0 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:30:32,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:32,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 369 [2023-11-30 03:30:32,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:37,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 438#true, 434#true, 209#L87-4true, 364#true, 427#true, 420#true, 404#(= |#race~f~0| 0), 372#true, 389#(= |#race~x1~0| 0), 206#L67-1true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:37,676 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 03:30:37,676 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:37,676 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 03:30:37,676 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-30 03:30:37,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 25#L87-6true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 420#true, 404#(= |#race~f~0| 0), 372#true, 389#(= |#race~x1~0| 0), 206#L67-1true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:37,676 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:37,676 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:37,676 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:37,676 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:37,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 420#true, 404#(= |#race~f~0| 0), 372#true, 389#(= |#race~x1~0| 0), 255#L87-5true, 206#L67-1true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:37,676 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:37,676 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:37,677 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:37,677 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:37,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][811], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 438#true, 434#true, 209#L87-4true, 364#true, 4#L51-1true, 427#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 372#true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:37,677 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 03:30:37,677 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 03:30:37,677 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-30 03:30:37,677 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:37,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][811], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 25#L87-6true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 420#true, 404#(= |#race~f~0| 0), 389#(= |#race~x1~0| 0), 372#true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:37,677 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:37,677 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:37,678 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:37,678 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:37,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][811], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 420#true, 404#(= |#race~f~0| 0), 389#(= |#race~x1~0| 0), 372#true, 255#L87-5true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:37,678 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:37,678 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:37,678 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:37,678 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:37,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][811], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 276#L51-2true, 438#true, 434#true, 209#L87-4true, 364#true, 427#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 372#true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:37,701 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:37,701 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:37,701 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:37,701 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:37,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][811], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 276#L51-2true, 438#true, 434#true, 364#true, 25#L87-6true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 372#true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:37,701 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-30 03:30:37,701 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2023-11-30 03:30:37,701 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2023-11-30 03:30:37,701 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-30 03:30:37,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][811], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 276#L51-2true, 438#true, 434#true, 364#true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 372#true, 255#L87-5true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:37,702 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:37,702 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:37,702 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:37,702 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:37,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][283], [395#true, 406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 241#L64-1true, 404#(= |#race~f~0| 0), 420#true, 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0), 202#L86-4true]) [2023-11-30 03:30:37,855 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-30 03:30:37,855 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2023-11-30 03:30:37,855 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-30 03:30:37,855 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 03:30:37,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][283], [395#true, 406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 404#(= |#race~f~0| 0), 420#true, 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 393#(= |#race~x2~0| 0), 222#L64-2true, 379#true, 202#L86-4true]) [2023-11-30 03:30:37,857 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2023-11-30 03:30:37,857 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-30 03:30:37,857 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2023-11-30 03:30:37,857 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 03:30:37,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][283], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 179#L87-1true, 241#L64-1true, 420#true, 404#(= |#race~f~0| 0), 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:37,858 INFO L294 olderBase$Statistics]: this new event has 298 ancestors and is cut-off event [2023-11-30 03:30:37,858 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-30 03:30:37,858 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-30 03:30:37,858 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-30 03:30:37,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][283], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 179#L87-1true, 404#(= |#race~f~0| 0), 420#true, 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 222#L64-2true]) [2023-11-30 03:30:37,859 INFO L294 olderBase$Statistics]: this new event has 299 ancestors and is cut-off event [2023-11-30 03:30:37,859 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-30 03:30:37,859 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 03:30:37,859 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2023-11-30 03:30:37,860 INFO L124 PetriNetUnfolderBase]: 12911/28268 cut-off events. [2023-11-30 03:30:37,860 INFO L125 PetriNetUnfolderBase]: For 107484/157268 co-relation queries the response was YES. [2023-11-30 03:30:38,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125870 conditions, 28268 events. 12911/28268 cut-off events. For 107484/157268 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 238585 event pairs, 3951 based on Foata normal form. 1/25248 useless extension candidates. Maximal degree in co-relation 124154. Up to 12879 conditions per place. [2023-11-30 03:30:38,230 INFO L140 encePairwiseOnDemand]: 351/369 looper letters, 608 selfloop transitions, 468 changer transitions 12/1333 dead transitions. [2023-11-30 03:30:38,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 1333 transitions, 16518 flow [2023-11-30 03:30:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:30:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:30:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1884 transitions. [2023-11-30 03:30:38,234 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8509485094850948 [2023-11-30 03:30:38,234 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1884 transitions. [2023-11-30 03:30:38,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1884 transitions. [2023-11-30 03:30:38,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:38,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1884 transitions. [2023-11-30 03:30:38,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 314.0) internal successors, (1884), 6 states have internal predecessors, (1884), 0 states have call successors, (0), 0 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:30:38,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 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:30:38,239 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 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:30:38,239 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 13 predicate places. [2023-11-30 03:30:38,239 INFO L500 AbstractCegarLoop]: Abstraction has has 348 places, 1333 transitions, 16518 flow [2023-11-30 03:30:38,240 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 295.1666666666667) internal successors, (1771), 6 states have internal predecessors, (1771), 0 states have call successors, (0), 0 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:30:38,240 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:38,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:38,240 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:30:38,240 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:38,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:38,241 INFO L85 PathProgramCache]: Analyzing trace with hash -925923454, now seen corresponding path program 1 times [2023-11-30 03:30:38,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:38,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672857167] [2023-11-30 03:30:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:38,269 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:30:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:38,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672857167] [2023-11-30 03:30:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672857167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:38,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615535286] [2023-11-30 03:30:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:38,270 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:38,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:38,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:38,271 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 369 [2023-11-30 03:30:38,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 1333 transitions, 16518 flow. Second operand has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 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:30:38,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:38,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 369 [2023-11-30 03:30:38,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:43,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 25#L87-6true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 372#true, 445#true, 360#true, 206#L67-1true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:43,601 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:43,602 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:43,602 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:43,602 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:43,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 385#(= |#race~n~0| 0), 438#true, 434#true, 209#L87-4true, 364#true, 427#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 372#true, 445#true, 360#true, 206#L67-1true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:43,602 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 03:30:43,602 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 03:30:43,603 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-30 03:30:43,603 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:43,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 420#true, 255#L87-5true, 389#(= |#race~x1~0| 0), 372#true, 445#true, 360#true, 206#L67-1true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:43,603 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:43,603 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:43,603 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:43,603 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:43,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 25#L87-6true, 4#L51-1true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 372#true, 445#true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:43,604 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:43,604 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:43,604 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:43,604 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:43,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 385#(= |#race~n~0| 0), 438#true, 434#true, 209#L87-4true, 364#true, 4#L51-1true, 427#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 372#true, 445#true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:43,605 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 03:30:43,605 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:43,605 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 03:30:43,605 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-30 03:30:43,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 372#true, 255#L87-5true, 445#true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:43,605 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:43,605 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:43,605 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:43,605 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:43,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 276#L51-2true, 438#true, 434#true, 364#true, 25#L87-6true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 420#true, 404#(= |#race~f~0| 0), 389#(= |#race~x1~0| 0), 372#true, 445#true, 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:43,629 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-30 03:30:43,629 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2023-11-30 03:30:43,629 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2023-11-30 03:30:43,629 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-30 03:30:43,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 385#(= |#race~n~0| 0), 276#L51-2true, 438#true, 434#true, 209#L87-4true, 364#true, 427#true, 420#true, 404#(= |#race~f~0| 0), 389#(= |#race~x1~0| 0), 372#true, 445#true, 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:43,629 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:43,629 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:43,629 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:43,629 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:43,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 276#L51-2true, 438#true, 434#true, 364#true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 372#true, 255#L87-5true, 445#true, 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:43,629 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:43,629 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:43,629 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:43,629 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:43,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 420#true, 404#(= |#race~f~0| 0), 241#L64-1true, 389#(= |#race~x1~0| 0), 445#true, 372#true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0), 202#L86-4true]) [2023-11-30 03:30:43,798 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-30 03:30:43,798 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 03:30:43,798 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2023-11-30 03:30:43,798 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-30 03:30:43,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 420#true, 404#(= |#race~f~0| 0), 389#(= |#race~x1~0| 0), 445#true, 372#true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0), 222#L64-2true, 202#L86-4true]) [2023-11-30 03:30:43,800 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2023-11-30 03:30:43,800 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-30 03:30:43,800 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 03:30:43,800 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2023-11-30 03:30:43,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [406#true, 395#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 179#L87-1true, 404#(= |#race~f~0| 0), 420#true, 241#L64-1true, 445#true, 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:43,802 INFO L294 olderBase$Statistics]: this new event has 298 ancestors and is cut-off event [2023-11-30 03:30:43,802 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-30 03:30:43,802 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-30 03:30:43,802 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-30 03:30:43,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [406#true, 395#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 179#L87-1true, 420#true, 404#(= |#race~f~0| 0), 445#true, 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 222#L64-2true]) [2023-11-30 03:30:43,803 INFO L294 olderBase$Statistics]: this new event has 299 ancestors and is cut-off event [2023-11-30 03:30:43,803 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2023-11-30 03:30:43,803 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-30 03:30:43,803 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 03:30:43,805 INFO L124 PetriNetUnfolderBase]: 12909/28209 cut-off events. [2023-11-30 03:30:43,805 INFO L125 PetriNetUnfolderBase]: For 137169/188067 co-relation queries the response was YES. [2023-11-30 03:30:43,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127525 conditions, 28209 events. 12909/28209 cut-off events. For 137169/188067 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 237935 event pairs, 3970 based on Foata normal form. 5/25247 useless extension candidates. Maximal degree in co-relation 125747. Up to 12877 conditions per place. [2023-11-30 03:30:44,104 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 74 selfloop transitions, 2 changer transitions 12/1334 dead transitions. [2023-11-30 03:30:44,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 1334 transitions, 16750 flow [2023-11-30 03:30:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2023-11-30 03:30:44,106 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8744354110207768 [2023-11-30 03:30:44,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 968 transitions. [2023-11-30 03:30:44,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 968 transitions. [2023-11-30 03:30:44,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:44,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 968 transitions. [2023-11-30 03:30:44,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 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:30:44,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:44,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:44,110 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 14 predicate places. [2023-11-30 03:30:44,110 INFO L500 AbstractCegarLoop]: Abstraction has has 349 places, 1334 transitions, 16750 flow [2023-11-30 03:30:44,110 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 0 states have call successors, (0), 0 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:30:44,110 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:44,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:44,110 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:30:44,110 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:44,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash 665171929, now seen corresponding path program 1 times [2023-11-30 03:30:44,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:44,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259326579] [2023-11-30 03:30:44,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:44,139 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:30:44,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:44,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259326579] [2023-11-30 03:30:44,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259326579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:44,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:44,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:44,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564903595] [2023-11-30 03:30:44,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:44,140 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:44,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:44,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:44,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:44,141 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 369 [2023-11-30 03:30:44,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 1334 transitions, 16750 flow. Second operand has 3 states, 3 states have (on average 316.6666666666667) internal successors, (950), 3 states have internal predecessors, (950), 0 states have call successors, (0), 0 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:30:44,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:44,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 369 [2023-11-30 03:30:44,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:49,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 420#true, 404#(= |#race~f~0| 0), 449#true, 372#true, 389#(= |#race~x1~0| 0), 255#L87-5true, 445#true, 360#true, 206#L67-1true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:49,925 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:49,925 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:49,925 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:49,925 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:49,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 25#L87-6true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 420#true, 449#true, 372#true, 389#(= |#race~x1~0| 0), 445#true, 360#true, 206#L67-1true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:49,925 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:49,925 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:49,925 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:49,925 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:49,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 438#true, 434#true, 209#L87-4true, 364#true, 427#true, 420#true, 404#(= |#race~f~0| 0), 449#true, 389#(= |#race~x1~0| 0), 372#true, 445#true, 360#true, 206#L67-1true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:49,926 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 03:30:49,926 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 03:30:49,926 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:49,926 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-30 03:30:49,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 420#true, 404#(= |#race~f~0| 0), 449#true, 372#true, 445#true, 255#L87-5true, 389#(= |#race~x1~0| 0), 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:49,927 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:49,927 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:49,927 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:49,927 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:49,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 25#L87-6true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 420#true, 404#(= |#race~f~0| 0), 449#true, 445#true, 372#true, 389#(= |#race~x1~0| 0), 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:49,927 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:49,927 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:49,927 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:49,927 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:49,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 385#(= |#race~n~0| 0), 438#true, 434#true, 209#L87-4true, 364#true, 4#L51-1true, 427#true, 420#true, 404#(= |#race~f~0| 0), 449#true, 445#true, 372#true, 389#(= |#race~x1~0| 0), 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:49,927 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 03:30:49,928 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:49,928 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-30 03:30:49,928 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 03:30:49,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 276#L51-2true, 438#true, 434#true, 364#true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 449#true, 420#true, 372#true, 445#true, 255#L87-5true, 389#(= |#race~x1~0| 0), 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:49,953 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:49,953 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:49,953 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:49,953 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:49,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 276#L51-2true, 438#true, 434#true, 364#true, 25#L87-6true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 420#true, 449#true, 445#true, 372#true, 389#(= |#race~x1~0| 0), 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:49,953 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-30 03:30:49,953 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2023-11-30 03:30:49,953 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-30 03:30:49,953 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2023-11-30 03:30:49,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 385#(= |#race~n~0| 0), 276#L51-2true, 438#true, 434#true, 209#L87-4true, 364#true, 427#true, 420#true, 404#(= |#race~f~0| 0), 449#true, 445#true, 372#true, 389#(= |#race~x1~0| 0), 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true]) [2023-11-30 03:30:49,954 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:49,954 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:49,954 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:49,954 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:50,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [395#true, 406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 449#true, 241#L64-1true, 420#true, 404#(= |#race~f~0| 0), 445#true, 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 202#L86-4true]) [2023-11-30 03:30:50,133 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-30 03:30:50,133 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2023-11-30 03:30:50,133 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 03:30:50,133 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-30 03:30:50,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [395#true, 406#true, 370#(= |#race~size~0| 0), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 449#true, 420#true, 404#(= |#race~f~0| 0), 445#true, 372#true, 389#(= |#race~x1~0| 0), 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 222#L64-2true, 202#L86-4true]) [2023-11-30 03:30:50,135 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2023-11-30 03:30:50,135 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 03:30:50,135 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2023-11-30 03:30:50,135 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-30 03:30:50,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [406#true, 395#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 179#L87-1true, 449#true, 420#true, 241#L64-1true, 404#(= |#race~f~0| 0), 372#true, 389#(= |#race~x1~0| 0), 445#true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0)]) [2023-11-30 03:30:50,137 INFO L294 olderBase$Statistics]: this new event has 298 ancestors and is cut-off event [2023-11-30 03:30:50,137 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-30 03:30:50,137 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-30 03:30:50,137 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-30 03:30:50,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [406#true, 395#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 179#L87-1true, 449#true, 420#true, 404#(= |#race~f~0| 0), 372#true, 389#(= |#race~x1~0| 0), 445#true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0), 222#L64-2true]) [2023-11-30 03:30:50,138 INFO L294 olderBase$Statistics]: this new event has 299 ancestors and is cut-off event [2023-11-30 03:30:50,138 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 03:30:50,139 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-30 03:30:50,139 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2023-11-30 03:30:50,140 INFO L124 PetriNetUnfolderBase]: 12915/28174 cut-off events. [2023-11-30 03:30:50,140 INFO L125 PetriNetUnfolderBase]: For 168222/219783 co-relation queries the response was YES. [2023-11-30 03:30:50,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129129 conditions, 28174 events. 12915/28174 cut-off events. For 168222/219783 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 237460 event pairs, 3980 based on Foata normal form. 7/25240 useless extension candidates. Maximal degree in co-relation 127289. Up to 12868 conditions per place. [2023-11-30 03:30:50,442 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 75 selfloop transitions, 2 changer transitions 12/1335 dead transitions. [2023-11-30 03:30:50,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1335 transitions, 16986 flow [2023-11-30 03:30:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2023-11-30 03:30:50,444 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8735320686540199 [2023-11-30 03:30:50,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 967 transitions. [2023-11-30 03:30:50,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 967 transitions. [2023-11-30 03:30:50,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:50,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 967 transitions. [2023-11-30 03:30:50,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 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:30:50,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:50,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:50,447 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 15 predicate places. [2023-11-30 03:30:50,447 INFO L500 AbstractCegarLoop]: Abstraction has has 350 places, 1335 transitions, 16986 flow [2023-11-30 03:30:50,447 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.6666666666667) internal successors, (950), 3 states have internal predecessors, (950), 0 states have call successors, (0), 0 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:30:50,447 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:50,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:50,447 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:30:50,447 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 69 more)] === [2023-11-30 03:30:50,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash -872340912, now seen corresponding path program 1 times [2023-11-30 03:30:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:50,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660714929] [2023-11-30 03:30:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:50,482 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:30:50,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:50,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660714929] [2023-11-30 03:30:50,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660714929] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:50,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:50,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034173510] [2023-11-30 03:30:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:50,483 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:50,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:50,484 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 369 [2023-11-30 03:30:50,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 1335 transitions, 16986 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 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:30:50,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:50,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 369 [2023-11-30 03:30:50,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:56,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 385#(= |#race~n~0| 0), 438#true, 434#true, 209#L87-4true, 364#true, 427#true, 449#true, 404#(= |#race~f~0| 0), 420#true, 372#true, 389#(= |#race~x1~0| 0), 445#true, 360#true, 206#L67-1true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 453#true]) [2023-11-30 03:30:56,273 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 03:30:56,274 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-30 03:30:56,274 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 03:30:56,274 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:56,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 449#true, 420#true, 404#(= |#race~f~0| 0), 255#L87-5true, 389#(= |#race~x1~0| 0), 445#true, 372#true, 360#true, 206#L67-1true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 453#true]) [2023-11-30 03:30:56,274 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:56,274 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:56,274 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:56,274 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:56,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([855] L51-4-->L51-5: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_3 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~x1~0=v_~x1~0_3, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2#1][396], [406#true, 26#L51-5true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 25#L87-6true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 449#true, 404#(= |#race~f~0| 0), 420#true, 372#true, 389#(= |#race~x1~0| 0), 445#true, 360#true, 206#L67-1true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 453#true]) [2023-11-30 03:30:56,274 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:56,274 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:56,274 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:56,274 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:56,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 385#(= |#race~n~0| 0), 438#true, 434#true, 209#L87-4true, 364#true, 4#L51-1true, 427#true, 404#(= |#race~f~0| 0), 420#true, 449#true, 372#true, 445#true, 389#(= |#race~x1~0| 0), 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 453#true]) [2023-11-30 03:30:56,275 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2023-11-30 03:30:56,275 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:56,275 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-30 03:30:56,276 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-30 03:30:56,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 420#true, 449#true, 255#L87-5true, 445#true, 389#(= |#race~x1~0| 0), 372#true, 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 453#true]) [2023-11-30 03:30:56,276 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:56,276 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:56,276 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:56,276 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:56,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 25#L87-6true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 404#(= |#race~f~0| 0), 420#true, 449#true, 372#true, 445#true, 389#(= |#race~x1~0| 0), 160#L67-5true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 453#true]) [2023-11-30 03:30:56,276 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:56,276 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:56,276 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:56,276 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:56,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 399#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 385#(= |#race~n~0| 0), 276#L51-2true, 438#true, 434#true, 209#L87-4true, 364#true, 427#true, 449#true, 420#true, 404#(= |#race~f~0| 0), 372#true, 389#(= |#race~x1~0| 0), 445#true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0), 453#true]) [2023-11-30 03:30:56,303 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2023-11-30 03:30:56,303 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:56,303 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2023-11-30 03:30:56,303 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2023-11-30 03:30:56,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 276#L51-2true, 438#true, 434#true, 364#true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 420#true, 449#true, 404#(= |#race~f~0| 0), 255#L87-5true, 389#(= |#race~x1~0| 0), 372#true, 445#true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0), 453#true]) [2023-11-30 03:30:56,303 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-30 03:30:56,303 INFO L297 olderBase$Statistics]: existing Event has 272 ancestors and is cut-off event [2023-11-30 03:30:56,303 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2023-11-30 03:30:56,304 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-30 03:30:56,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L67-4-->L67-5: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem14#1_1| (select (select |v_#memory_int_4| v_~f~0.base_22) (+ v_~f~0.offset_22 (* v_~x2~0_23 4)))) InVars {#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} OutVars{#memory_int=|v_#memory_int_4|, ~x2~0=v_~x2~0_23, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_1|, ~f~0.base=v_~f~0.base_22, ~f~0.offset=v_~f~0.offset_22} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem14#1][812], [406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 276#L51-2true, 438#true, 434#true, 364#true, 25#L87-6true, 400#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 427#true, 449#true, 404#(= |#race~f~0| 0), 420#true, 372#true, 389#(= |#race~x1~0| 0), 445#true, 160#L67-5true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0), 453#true]) [2023-11-30 03:30:56,304 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-30 03:30:56,304 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2023-11-30 03:30:56,304 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-30 03:30:56,304 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2023-11-30 03:30:56,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 449#true, 241#L64-1true, 420#true, 404#(= |#race~f~0| 0), 389#(= |#race~x1~0| 0), 445#true, 372#true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0), 202#L86-4true, 453#true]) [2023-11-30 03:30:56,494 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-30 03:30:56,494 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-30 03:30:56,494 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 03:30:56,494 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2023-11-30 03:30:56,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 427#true, 449#true, 420#true, 404#(= |#race~f~0| 0), 389#(= |#race~x1~0| 0), 445#true, 372#true, 360#true, 413#true, 222#L64-2true, 379#true, 393#(= |#race~x2~0| 0), 202#L86-4true, 453#true]) [2023-11-30 03:30:56,496 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2023-11-30 03:30:56,496 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2023-11-30 03:30:56,496 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 03:30:56,496 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-30 03:30:56,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 179#L87-1true, 427#true, 449#true, 241#L64-1true, 420#true, 404#(= |#race~f~0| 0), 389#(= |#race~x1~0| 0), 445#true, 372#true, 360#true, 413#true, 379#true, 393#(= |#race~x2~0| 0), 453#true]) [2023-11-30 03:30:56,676 INFO L294 olderBase$Statistics]: this new event has 298 ancestors and is cut-off event [2023-11-30 03:30:56,676 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-30 03:30:56,676 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2023-11-30 03:30:56,677 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-30 03:30:56,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L51-->L51-1: Formula: (= |v_#race~f~0_1| 0) InVars {} OutVars{#race~f~0=|v_#race~f~0_1|} AuxVars[] AssignedVars[#race~f~0][282], [395#true, 406#true, thread1Thread1of1ForFork0InUse, 370#(= |#race~size~0| 0), thread2Thread1of1ForFork1InUse, 385#(= |#race~n~0| 0), 438#true, 434#true, 364#true, 4#L51-1true, 179#L87-1true, 427#true, 449#true, 404#(= |#race~f~0| 0), 420#true, 389#(= |#race~x1~0| 0), 445#true, 372#true, 360#true, 413#true, 393#(= |#race~x2~0| 0), 379#true, 222#L64-2true, 453#true]) [2023-11-30 03:30:56,678 INFO L294 olderBase$Statistics]: this new event has 299 ancestors and is cut-off event [2023-11-30 03:30:56,678 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-30 03:30:56,678 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 03:30:56,678 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2023-11-30 03:30:56,680 INFO L124 PetriNetUnfolderBase]: 12917/28137 cut-off events. [2023-11-30 03:30:56,680 INFO L125 PetriNetUnfolderBase]: For 201448/253588 co-relation queries the response was YES. [2023-11-30 03:30:56,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130708 conditions, 28137 events. 12917/28137 cut-off events. For 201448/253588 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 236646 event pairs, 3970 based on Foata normal form. 9/25250 useless extension candidates. Maximal degree in co-relation 128806. Up to 12875 conditions per place. [2023-11-30 03:30:56,863 INFO L140 encePairwiseOnDemand]: 366/369 looper letters, 0 selfloop transitions, 0 changer transitions 1336/1336 dead transitions. [2023-11-30 03:30:56,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 1336 transitions, 17226 flow [2023-11-30 03:30:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2023-11-30 03:30:56,865 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8726287262872628 [2023-11-30 03:30:56,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 966 transitions. [2023-11-30 03:30:56,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 966 transitions. [2023-11-30 03:30:56,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:56,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 966 transitions. [2023-11-30 03:30:56,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 0 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:30:56,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:56,868 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 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:30:56,868 INFO L307 CegarLoopForPetriNet]: 335 programPoint places, 16 predicate places. [2023-11-30 03:30:56,868 INFO L500 AbstractCegarLoop]: Abstraction has has 351 places, 1336 transitions, 17226 flow [2023-11-30 03:30:56,869 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 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:30:56,875 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/unroll-3.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:30:56,934 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (72 of 73 remaining) [2023-11-30 03:30:56,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (71 of 73 remaining) [2023-11-30 03:30:56,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (70 of 73 remaining) [2023-11-30 03:30:56,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (69 of 73 remaining) [2023-11-30 03:30:56,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (68 of 73 remaining) [2023-11-30 03:30:56,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (67 of 73 remaining) [2023-11-30 03:30:56,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (66 of 73 remaining) [2023-11-30 03:30:56,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (65 of 73 remaining) [2023-11-30 03:30:56,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 73 remaining) [2023-11-30 03:30:56,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (63 of 73 remaining) [2023-11-30 03:30:56,935 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (62 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (61 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (60 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (58 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (57 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (56 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (55 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (54 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (53 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (52 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (51 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (50 of 73 remaining) [2023-11-30 03:30:56,936 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (49 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (48 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (47 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (46 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (45 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (44 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (43 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (38 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 73 remaining) [2023-11-30 03:30:56,937 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (35 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (24 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (23 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (22 of 73 remaining) [2023-11-30 03:30:56,938 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (16 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (14 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (12 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (11 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (10 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (9 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (8 of 73 remaining) [2023-11-30 03:30:56,939 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (7 of 73 remaining) [2023-11-30 03:30:56,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (6 of 73 remaining) [2023-11-30 03:30:56,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (5 of 73 remaining) [2023-11-30 03:30:56,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (4 of 73 remaining) [2023-11-30 03:30:56,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (3 of 73 remaining) [2023-11-30 03:30:56,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (2 of 73 remaining) [2023-11-30 03:30:56,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (1 of 73 remaining) [2023-11-30 03:30:56,940 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (0 of 73 remaining) [2023-11-30 03:30:56,940 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 03:30:56,940 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:30:56,944 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:30:56,944 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:30:56,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:30:56 BasicIcfg [2023-11-30 03:30:56,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:30:56,948 INFO L158 Benchmark]: Toolchain (without parser) took 58702.99ms. Allocated memory was 690.0MB in the beginning and 11.1GB in the end (delta: 10.4GB). Free memory was 646.4MB in the beginning and 7.9GB in the end (delta: -7.3GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. [2023-11-30 03:30:56,949 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 440.4MB. Free memory is still 390.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:30:56,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.13ms. Allocated memory is still 690.0MB. Free memory was 646.0MB in the beginning and 633.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:30:56,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.23ms. Allocated memory is still 690.0MB. Free memory was 633.7MB in the beginning and 630.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:30:56,949 INFO L158 Benchmark]: Boogie Preprocessor took 35.60ms. Allocated memory is still 690.0MB. Free memory was 630.7MB in the beginning and 628.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:30:56,949 INFO L158 Benchmark]: RCFGBuilder took 499.45ms. Allocated memory is still 690.0MB. Free memory was 628.3MB in the beginning and 599.2MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-11-30 03:30:56,949 INFO L158 Benchmark]: TraceAbstraction took 57950.82ms. Allocated memory was 690.0MB in the beginning and 11.1GB in the end (delta: 10.4GB). Free memory was 598.5MB in the beginning and 7.9GB in the end (delta: -7.3GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. [2023-11-30 03:30:56,950 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.09ms. Allocated memory is still 440.4MB. Free memory is still 390.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 176.13ms. Allocated memory is still 690.0MB. Free memory was 646.0MB in the beginning and 633.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.23ms. Allocated memory is still 690.0MB. Free memory was 633.7MB in the beginning and 630.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.60ms. Allocated memory is still 690.0MB. Free memory was 630.7MB in the beginning and 628.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 499.45ms. Allocated memory is still 690.0MB. Free memory was 628.3MB in the beginning and 599.2MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 57950.82ms. Allocated memory was 690.0MB in the beginning and 11.1GB in the end (delta: 10.4GB). Free memory was 598.5MB in the beginning and 7.9GB in the end (delta: -7.3GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 543 locations, 73 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: 57.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 55.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 232 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 458 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 296 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1607 IncrementalHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 296 mSolverCounterUnsat, 426 mSDtfsCounter, 1607 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17226occurred in iteration=19, InterpolantAutomatonStates: 76, 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, 1.9s InterpolantComputationTime, 1841 NumberOfCodeBlocks, 1841 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1822 ConstructedInterpolants, 0 QuantifiedInterpolants, 2699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 - AllSpecificationsHoldResult: All specifications hold 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:30:56,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...