/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-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:29:47,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:29:47,555 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:47,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:29:47,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:29:47,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:29:47,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:29:47,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:29:47,625 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:29:47,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:29:47,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:29:47,628 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:29:47,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:29:47,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:29:47,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:29:47,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:29:47,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:29:47,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:29:47,630 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:29:47,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:29:47,630 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:29:47,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:29:47,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:29:47,631 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:29:47,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:29:47,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:29:47,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:29:47,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:29:47,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:29:47,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:29:47,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:29:47,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:29:47,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:29:47,633 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:47,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:29:47,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:29:47,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:29:47,907 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:29:47,907 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:29:47,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2023-11-30 03:29:48,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:29:49,103 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:29:49,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2023-11-30 03:29:49,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f15e6c46/d461cbb678d44518a23e77972796d6ff/FLAGc2c4fff4e [2023-11-30 03:29:49,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f15e6c46/d461cbb678d44518a23e77972796d6ff [2023-11-30 03:29:49,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:29:49,121 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:29:49,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:29:49,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:29:49,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:29:49,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:29:49" (1/1) ... [2023-11-30 03:29:49,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7346561c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:49, skipping insertion in model container [2023-11-30 03:29:49,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:29:49" (1/1) ... [2023-11-30 03:29:49,147 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:29:49,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:29:49,279 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:29:49,298 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:29:49,307 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:29:49,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:49 WrapperNode [2023-11-30 03:29:49,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:29:49,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:29:49,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:29:49,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:29:49,314 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:49" (1/1) ... [2023-11-30 03:29:49,320 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:49" (1/1) ... [2023-11-30 03:29:49,340 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 253 [2023-11-30 03:29:49,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:29:49,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:29:49,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:29:49,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:29:49,347 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:49" (1/1) ... [2023-11-30 03:29:49,348 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:49" (1/1) ... [2023-11-30 03:29:49,357 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:49" (1/1) ... [2023-11-30 03:29:49,358 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:49" (1/1) ... [2023-11-30 03:29:49,365 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:49" (1/1) ... [2023-11-30 03:29:49,379 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:49" (1/1) ... [2023-11-30 03:29:49,381 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:49" (1/1) ... [2023-11-30 03:29:49,382 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:49" (1/1) ... [2023-11-30 03:29:49,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:29:49,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:29:49,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:29:49,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:29:49,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:49" (1/1) ... [2023-11-30 03:29:49,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:29:49,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:29:49,406 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:49,408 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:49,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 03:29:49,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 03:29:49,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 03:29:49,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 03:29:49,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 03:29:49,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 03:29:49,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:29:49,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:29:49,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:29:49,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:29:49,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:29:49,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:29:49,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:29:49,427 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:49,494 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:29:49,495 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:29:49,785 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:29:49,796 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:29:49,796 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-30 03:29:49,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:29:49 BoogieIcfgContainer [2023-11-30 03:29:49,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:29:49,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:29:49,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:29:49,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:29:49,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:29:49" (1/3) ... [2023-11-30 03:29:49,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbb4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:29:49, skipping insertion in model container [2023-11-30 03:29:49,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:29:49" (2/3) ... [2023-11-30 03:29:49,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dbb4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:29:49, skipping insertion in model container [2023-11-30 03:29:49,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:29:49" (3/3) ... [2023-11-30 03:29:49,803 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2023-11-30 03:29:49,814 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:29:49,814 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-30 03:29:49,814 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:29:49,892 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:29:49,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 314 places, 324 transitions, 662 flow [2023-11-30 03:29:49,992 INFO L124 PetriNetUnfolderBase]: 17/322 cut-off events. [2023-11-30 03:29:49,992 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 03:29:49,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 322 events. 17/322 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 517 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 177. Up to 2 conditions per place. [2023-11-30 03:29:49,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 314 places, 324 transitions, 662 flow [2023-11-30 03:29:50,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 301 transitions, 614 flow [2023-11-30 03:29:50,009 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:29:50,014 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;@6f988094, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:29:50,014 INFO L363 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-30 03:29:50,018 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:29:50,018 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2023-11-30 03:29:50,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:29:50,018 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:50,019 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:50,019 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:29:50,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1999538098, now seen corresponding path program 1 times [2023-11-30 03:29:50,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:50,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133036801] [2023-11-30 03:29:50,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:50,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:50,161 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:50,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:50,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133036801] [2023-11-30 03:29:50,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133036801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:50,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:50,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:50,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270038333] [2023-11-30 03:29:50,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:50,169 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:50,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:50,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:50,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:50,190 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 324 [2023-11-30 03:29:50,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 301 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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:50,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:50,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 324 [2023-11-30 03:29:50,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:50,344 INFO L124 PetriNetUnfolderBase]: 39/800 cut-off events. [2023-11-30 03:29:50,344 INFO L125 PetriNetUnfolderBase]: For 37/54 co-relation queries the response was YES. [2023-11-30 03:29:50,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 800 events. 39/800 cut-off events. For 37/54 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3800 event pairs, 15 based on Foata normal form. 18/661 useless extension candidates. Maximal degree in co-relation 667. Up to 55 conditions per place. [2023-11-30 03:29:50,353 INFO L140 encePairwiseOnDemand]: 311/324 looper letters, 16 selfloop transitions, 2 changer transitions 4/290 dead transitions. [2023-11-30 03:29:50,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 290 transitions, 628 flow [2023-11-30 03:29:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2023-11-30 03:29:50,369 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9310699588477366 [2023-11-30 03:29:50,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 905 transitions. [2023-11-30 03:29:50,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 905 transitions. [2023-11-30 03:29:50,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:50,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 905 transitions. [2023-11-30 03:29:50,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 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:50,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:50,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:50,387 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 1 predicate places. [2023-11-30 03:29:50,387 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 290 transitions, 628 flow [2023-11-30 03:29:50,388 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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:50,388 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:50,388 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:50,388 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:29:50,388 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:29:50,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1162862387, now seen corresponding path program 1 times [2023-11-30 03:29:50,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:50,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326010158] [2023-11-30 03:29:50,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:50,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:50,446 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:50,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326010158] [2023-11-30 03:29:50,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326010158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:50,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:50,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389711240] [2023-11-30 03:29:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:50,449 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:50,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:50,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:50,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:50,451 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 324 [2023-11-30 03:29:50,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 290 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 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:50,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:50,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 324 [2023-11-30 03:29:50,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:50,624 INFO L124 PetriNetUnfolderBase]: 77/1135 cut-off events. [2023-11-30 03:29:50,624 INFO L125 PetriNetUnfolderBase]: For 159/176 co-relation queries the response was YES. [2023-11-30 03:29:50,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 1135 events. 77/1135 cut-off events. For 159/176 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6619 event pairs, 42 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 1102. Up to 107 conditions per place. [2023-11-30 03:29:50,630 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 22 selfloop transitions, 2 changer transitions 4/289 dead transitions. [2023-11-30 03:29:50,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 289 transitions, 674 flow [2023-11-30 03:29:50,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2023-11-30 03:29:50,633 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9084362139917695 [2023-11-30 03:29:50,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 883 transitions. [2023-11-30 03:29:50,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 883 transitions. [2023-11-30 03:29:50,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:50,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 883 transitions. [2023-11-30 03:29:50,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 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:50,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:50,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:50,638 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 2 predicate places. [2023-11-30 03:29:50,638 INFO L500 AbstractCegarLoop]: Abstraction has has 294 places, 289 transitions, 674 flow [2023-11-30 03:29:50,638 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 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:50,638 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:50,639 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:29:50,639 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:29:50,639 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:29:50,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1308465579, now seen corresponding path program 1 times [2023-11-30 03:29:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:50,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599772673] [2023-11-30 03:29:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:50,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:50,698 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:50,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:50,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599772673] [2023-11-30 03:29:50,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599772673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:50,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:50,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:50,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391550593] [2023-11-30 03:29:50,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:50,700 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:50,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:50,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:50,702 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 324 [2023-11-30 03:29:50,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 289 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 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:50,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:50,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 324 [2023-11-30 03:29:50,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:50,829 INFO L124 PetriNetUnfolderBase]: 61/1022 cut-off events. [2023-11-30 03:29:50,830 INFO L125 PetriNetUnfolderBase]: For 244/269 co-relation queries the response was YES. [2023-11-30 03:29:50,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 1022 events. 61/1022 cut-off events. For 244/269 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5591 event pairs, 29 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 1003. Up to 68 conditions per place. [2023-11-30 03:29:50,840 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 15 selfloop transitions, 1 changer transitions 4/284 dead transitions. [2023-11-30 03:29:50,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 284 transitions, 686 flow [2023-11-30 03:29:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2023-11-30 03:29:50,842 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2023-11-30 03:29:50,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 891 transitions. [2023-11-30 03:29:50,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 891 transitions. [2023-11-30 03:29:50,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:50,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 891 transitions. [2023-11-30 03:29:50,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 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:50,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:50,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:50,846 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, -1 predicate places. [2023-11-30 03:29:50,847 INFO L500 AbstractCegarLoop]: Abstraction has has 291 places, 284 transitions, 686 flow [2023-11-30 03:29:50,847 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 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:50,847 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:50,847 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:29:50,847 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:29:50,848 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:29:50,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash -627251288, now seen corresponding path program 1 times [2023-11-30 03:29:50,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:50,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438880228] [2023-11-30 03:29:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:50,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:51,459 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:51,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:51,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438880228] [2023-11-30 03:29:51,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438880228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:51,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:51,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:29:51,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835750049] [2023-11-30 03:29:51,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:51,461 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:29:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:51,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:29:51,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:29:51,466 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 324 [2023-11-30 03:29:51,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 284 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 260.8333333333333) internal successors, (1565), 6 states have internal predecessors, (1565), 0 states have call successors, (0), 0 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:51,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:51,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 324 [2023-11-30 03:29:51,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:52,762 INFO L124 PetriNetUnfolderBase]: 2162/9916 cut-off events. [2023-11-30 03:29:52,763 INFO L125 PetriNetUnfolderBase]: For 1098/1297 co-relation queries the response was YES. [2023-11-30 03:29:52,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14184 conditions, 9916 events. 2162/9916 cut-off events. For 1098/1297 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 107364 event pairs, 1697 based on Foata normal form. 0/8131 useless extension candidates. Maximal degree in co-relation 13861. Up to 3031 conditions per place. [2023-11-30 03:29:52,826 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 47 selfloop transitions, 5 changer transitions 4/283 dead transitions. [2023-11-30 03:29:52,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 283 transitions, 788 flow [2023-11-30 03:29:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:29:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:29:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2023-11-30 03:29:52,829 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8266460905349794 [2023-11-30 03:29:52,829 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1607 transitions. [2023-11-30 03:29:52,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1607 transitions. [2023-11-30 03:29:52,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:52,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1607 transitions. [2023-11-30 03:29:52,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 267.8333333333333) internal successors, (1607), 6 states have internal predecessors, (1607), 0 states have call successors, (0), 0 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:52,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 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:52,836 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 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:52,838 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 3 predicate places. [2023-11-30 03:29:52,839 INFO L500 AbstractCegarLoop]: Abstraction has has 295 places, 283 transitions, 788 flow [2023-11-30 03:29:52,839 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 260.8333333333333) internal successors, (1565), 6 states have internal predecessors, (1565), 0 states have call successors, (0), 0 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:52,839 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:52,841 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:29:52,841 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:29:52,841 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:29:52,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash 602194675, now seen corresponding path program 1 times [2023-11-30 03:29:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:52,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412288517] [2023-11-30 03:29:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:52,869 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:52,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:52,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412288517] [2023-11-30 03:29:52,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412288517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:52,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:52,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:52,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429789632] [2023-11-30 03:29:52,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:52,870 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:52,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:52,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:52,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:52,872 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 324 [2023-11-30 03:29:52,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 283 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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:52,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:52,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 324 [2023-11-30 03:29:52,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:54,192 INFO L124 PetriNetUnfolderBase]: 2562/11771 cut-off events. [2023-11-30 03:29:54,192 INFO L125 PetriNetUnfolderBase]: For 2951/3384 co-relation queries the response was YES. [2023-11-30 03:29:54,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17499 conditions, 11771 events. 2562/11771 cut-off events. For 2951/3384 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 130423 event pairs, 2090 based on Foata normal form. 0/9607 useless extension candidates. Maximal degree in co-relation 17130. Up to 3480 conditions per place. [2023-11-30 03:29:54,264 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 16 selfloop transitions, 2 changer transitions 4/282 dead transitions. [2023-11-30 03:29:54,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 282 transitions, 822 flow [2023-11-30 03:29:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2023-11-30 03:29:54,267 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9207818930041153 [2023-11-30 03:29:54,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 895 transitions. [2023-11-30 03:29:54,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 895 transitions. [2023-11-30 03:29:54,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:54,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 895 transitions. [2023-11-30 03:29:54,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 0 states have call successors, (0), 0 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:54,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:54,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:54,273 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 4 predicate places. [2023-11-30 03:29:54,273 INFO L500 AbstractCegarLoop]: Abstraction has has 296 places, 282 transitions, 822 flow [2023-11-30 03:29:54,273 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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:54,273 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:54,274 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:29:54,274 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 03:29:54,274 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:29:54,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1309465587, now seen corresponding path program 1 times [2023-11-30 03:29:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:54,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413704710] [2023-11-30 03:29:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:54,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:54,314 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:54,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:54,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413704710] [2023-11-30 03:29:54,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413704710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:54,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:54,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:54,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374446718] [2023-11-30 03:29:54,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:54,319 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:54,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:54,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:54,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:54,321 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 324 [2023-11-30 03:29:54,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 282 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 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:54,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:54,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 324 [2023-11-30 03:29:54,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:55,502 INFO L124 PetriNetUnfolderBase]: 2418/10959 cut-off events. [2023-11-30 03:29:55,502 INFO L125 PetriNetUnfolderBase]: For 4211/4740 co-relation queries the response was YES. [2023-11-30 03:29:55,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16583 conditions, 10959 events. 2418/10959 cut-off events. For 4211/4740 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 119408 event pairs, 1981 based on Foata normal form. 0/9001 useless extension candidates. Maximal degree in co-relation 16203. Up to 3315 conditions per place. [2023-11-30 03:29:55,634 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 11 selfloop transitions, 1 changer transitions 4/279 dead transitions. [2023-11-30 03:29:55,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 279 transitions, 834 flow [2023-11-30 03:29:55,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:55,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2023-11-30 03:29:55,650 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9290123456790124 [2023-11-30 03:29:55,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 903 transitions. [2023-11-30 03:29:55,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 903 transitions. [2023-11-30 03:29:55,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:55,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 903 transitions. [2023-11-30 03:29:55,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 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:55,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:55,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:55,656 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 3 predicate places. [2023-11-30 03:29:55,657 INFO L500 AbstractCegarLoop]: Abstraction has has 295 places, 279 transitions, 834 flow [2023-11-30 03:29:55,657 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 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:55,657 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:55,657 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:29:55,657 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 03:29:55,657 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:29:55,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1330616131, now seen corresponding path program 1 times [2023-11-30 03:29:55,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:55,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865502519] [2023-11-30 03:29:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:55,741 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:55,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:55,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865502519] [2023-11-30 03:29:55,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865502519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:55,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:55,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:55,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386713105] [2023-11-30 03:29:55,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:55,745 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:55,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:55,746 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 324 [2023-11-30 03:29:55,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 279 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 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:55,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:55,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 324 [2023-11-30 03:29:55,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:57,395 INFO L124 PetriNetUnfolderBase]: 2427/10908 cut-off events. [2023-11-30 03:29:57,395 INFO L125 PetriNetUnfolderBase]: For 9818/11233 co-relation queries the response was YES. [2023-11-30 03:29:57,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16891 conditions, 10908 events. 2427/10908 cut-off events. For 9818/11233 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 118680 event pairs, 1973 based on Foata normal form. 28/9038 useless extension candidates. Maximal degree in co-relation 16397. Up to 3324 conditions per place. [2023-11-30 03:29:57,451 INFO L140 encePairwiseOnDemand]: 317/324 looper letters, 13 selfloop transitions, 3 changer transitions 4/276 dead transitions. [2023-11-30 03:29:57,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 276 transitions, 875 flow [2023-11-30 03:29:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2023-11-30 03:29:57,454 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9248971193415638 [2023-11-30 03:29:57,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 899 transitions. [2023-11-30 03:29:57,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 899 transitions. [2023-11-30 03:29:57,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:57,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 899 transitions. [2023-11-30 03:29:57,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 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:57,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:57,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:57,459 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 1 predicate places. [2023-11-30 03:29:57,459 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 276 transitions, 875 flow [2023-11-30 03:29:57,459 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 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:57,459 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:57,459 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:29:57,459 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:29:57,459 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:29:57,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:57,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1766924299, now seen corresponding path program 1 times [2023-11-30 03:29:57,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:57,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042715153] [2023-11-30 03:29:57,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:57,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:57,494 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:57,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042715153] [2023-11-30 03:29:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042715153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:57,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:57,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:29:57,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216296470] [2023-11-30 03:29:57,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:57,496 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:29:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:57,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:29:57,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:29:57,497 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 324 [2023-11-30 03:29:57,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 276 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:29:57,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:57,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 324 [2023-11-30 03:29:57,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:29:58,694 INFO L124 PetriNetUnfolderBase]: 2451/10335 cut-off events. [2023-11-30 03:29:58,694 INFO L125 PetriNetUnfolderBase]: For 7096/7676 co-relation queries the response was YES. [2023-11-30 03:29:58,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17972 conditions, 10335 events. 2451/10335 cut-off events. For 7096/7676 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 109147 event pairs, 1963 based on Foata normal form. 3/8874 useless extension candidates. Maximal degree in co-relation 17452. Up to 3354 conditions per place. [2023-11-30 03:29:58,794 INFO L140 encePairwiseOnDemand]: 312/324 looper letters, 19 selfloop transitions, 4 changer transitions 9/270 dead transitions. [2023-11-30 03:29:58,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 270 transitions, 930 flow [2023-11-30 03:29:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:29:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:29:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2023-11-30 03:29:58,796 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8991769547325102 [2023-11-30 03:29:58,797 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 874 transitions. [2023-11-30 03:29:58,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 874 transitions. [2023-11-30 03:29:58,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:29:58,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 874 transitions. [2023-11-30 03:29:58,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 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:58,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:58,800 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:58,801 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, -4 predicate places. [2023-11-30 03:29:58,802 INFO L500 AbstractCegarLoop]: Abstraction has has 288 places, 270 transitions, 930 flow [2023-11-30 03:29:58,802 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 03:29:58,802 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:29:58,802 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:29:58,802 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:29:58,802 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:29:58,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:29:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash 575649876, now seen corresponding path program 1 times [2023-11-30 03:29:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:29:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051581251] [2023-11-30 03:29:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:29:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:29:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:29:59,202 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,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:29:59,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051581251] [2023-11-30 03:29:59,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051581251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:29:59,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:29:59,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:29:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170818447] [2023-11-30 03:29:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:29:59,203 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:29:59,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:29:59,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:29:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:29:59,204 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 324 [2023-11-30 03:29:59,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 270 transitions, 930 flow. Second operand has 6 states, 6 states have (on average 266.8333333333333) internal successors, (1601), 6 states have internal predecessors, (1601), 0 states have call successors, (0), 0 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,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:29:59,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 324 [2023-11-30 03:29:59,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:00,037 INFO L124 PetriNetUnfolderBase]: 2174/6499 cut-off events. [2023-11-30 03:30:00,037 INFO L125 PetriNetUnfolderBase]: For 17900/21885 co-relation queries the response was YES. [2023-11-30 03:30:00,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15482 conditions, 6499 events. 2174/6499 cut-off events. For 17900/21885 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 54268 event pairs, 510 based on Foata normal form. 185/5904 useless extension candidates. Maximal degree in co-relation 14922. Up to 3215 conditions per place. [2023-11-30 03:30:00,092 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 111 selfloop transitions, 4 changer transitions 9/341 dead transitions. [2023-11-30 03:30:00,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 341 transitions, 1446 flow [2023-11-30 03:30:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:30:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:30:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1705 transitions. [2023-11-30 03:30:00,096 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8770576131687243 [2023-11-30 03:30:00,096 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1705 transitions. [2023-11-30 03:30:00,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1705 transitions. [2023-11-30 03:30:00,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:00,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1705 transitions. [2023-11-30 03:30:00,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 284.1666666666667) internal successors, (1705), 6 states have internal predecessors, (1705), 0 states have call successors, (0), 0 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,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 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,102 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 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,103 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 0 predicate places. [2023-11-30 03:30:00,103 INFO L500 AbstractCegarLoop]: Abstraction has has 292 places, 341 transitions, 1446 flow [2023-11-30 03:30:00,103 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.8333333333333) internal successors, (1601), 6 states have internal predecessors, (1601), 0 states have call successors, (0), 0 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,103 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:00,104 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:00,104 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:30:00,104 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:30:00,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:00,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1859970023, now seen corresponding path program 1 times [2023-11-30 03:30:00,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:00,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033756330] [2023-11-30 03:30:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:00,136 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,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:00,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033756330] [2023-11-30 03:30:00,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033756330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:00,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:00,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:00,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366663824] [2023-11-30 03:30:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:00,137 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:00,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:00,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:00,139 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 324 [2023-11-30 03:30:00,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 341 transitions, 1446 flow. Second operand has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 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,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:00,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 324 [2023-11-30 03:30:00,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:01,045 INFO L124 PetriNetUnfolderBase]: 2228/8147 cut-off events. [2023-11-30 03:30:01,046 INFO L125 PetriNetUnfolderBase]: For 9788/13669 co-relation queries the response was YES. [2023-11-30 03:30:01,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18287 conditions, 8147 events. 2228/8147 cut-off events. For 9788/13669 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 75455 event pairs, 573 based on Foata normal form. 1/7260 useless extension candidates. Maximal degree in co-relation 17550. Up to 3178 conditions per place. [2023-11-30 03:30:01,092 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 17 selfloop transitions, 2 changer transitions 10/345 dead transitions. [2023-11-30 03:30:01,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 345 transitions, 1599 flow [2023-11-30 03:30:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2023-11-30 03:30:01,094 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.934156378600823 [2023-11-30 03:30:01,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 908 transitions. [2023-11-30 03:30:01,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 908 transitions. [2023-11-30 03:30:01,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:01,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 908 transitions. [2023-11-30 03:30:01,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 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:01,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:01,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:01,098 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, -1 predicate places. [2023-11-30 03:30:01,098 INFO L500 AbstractCegarLoop]: Abstraction has has 291 places, 345 transitions, 1599 flow [2023-11-30 03:30:01,099 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 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:01,099 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:01,099 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:01,099 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:30:01,099 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:30:01,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1129205901, now seen corresponding path program 1 times [2023-11-30 03:30:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:01,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845341378] [2023-11-30 03:30:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:01,155 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:01,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:01,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845341378] [2023-11-30 03:30:01,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845341378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:01,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:01,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 03:30:01,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447091684] [2023-11-30 03:30:01,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:01,157 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 03:30:01,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:01,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 03:30:01,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 03:30:01,158 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 324 [2023-11-30 03:30:01,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 345 transitions, 1599 flow. Second operand has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 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:01,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:01,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 324 [2023-11-30 03:30:01,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:02,883 INFO L124 PetriNetUnfolderBase]: 4194/14826 cut-off events. [2023-11-30 03:30:02,883 INFO L125 PetriNetUnfolderBase]: For 20932/28244 co-relation queries the response was YES. [2023-11-30 03:30:02,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35244 conditions, 14826 events. 4194/14826 cut-off events. For 20932/28244 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 145368 event pairs, 1109 based on Foata normal form. 100/13284 useless extension candidates. Maximal degree in co-relation 34077. Up to 5920 conditions per place. [2023-11-30 03:30:02,977 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 84 selfloop transitions, 6 changer transitions 11/388 dead transitions. [2023-11-30 03:30:02,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 388 transitions, 2129 flow [2023-11-30 03:30:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 03:30:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 03:30:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1498 transitions. [2023-11-30 03:30:02,980 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9246913580246914 [2023-11-30 03:30:02,980 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1498 transitions. [2023-11-30 03:30:02,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1498 transitions. [2023-11-30 03:30:02,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:02,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1498 transitions. [2023-11-30 03:30:02,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 299.6) internal successors, (1498), 5 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 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,985 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 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,985 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 3 predicate places. [2023-11-30 03:30:02,986 INFO L500 AbstractCegarLoop]: Abstraction has has 295 places, 388 transitions, 2129 flow [2023-11-30 03:30:02,986 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 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,986 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:02,986 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:02,986 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:30:02,986 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:30:02,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash -51768402, now seen corresponding path program 1 times [2023-11-30 03:30:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:02,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912098971] [2023-11-30 03:30:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:03,365 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:03,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:03,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912098971] [2023-11-30 03:30:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912098971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:03,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:03,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:30:03,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893748914] [2023-11-30 03:30:03,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:03,366 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:30:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:03,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:30:03,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:30:03,368 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 324 [2023-11-30 03:30:03,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 388 transitions, 2129 flow. Second operand has 6 states, 6 states have (on average 267.8333333333333) internal successors, (1607), 6 states have internal predecessors, (1607), 0 states have call successors, (0), 0 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:03,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:03,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 324 [2023-11-30 03:30:03,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:05,281 INFO L124 PetriNetUnfolderBase]: 4193/14501 cut-off events. [2023-11-30 03:30:05,281 INFO L125 PetriNetUnfolderBase]: For 27788/41771 co-relation queries the response was YES. [2023-11-30 03:30:05,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40665 conditions, 14501 events. 4193/14501 cut-off events. For 27788/41771 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 140082 event pairs, 1026 based on Foata normal form. 5/12934 useless extension candidates. Maximal degree in co-relation 39266. Up to 5900 conditions per place. [2023-11-30 03:30:05,376 INFO L140 encePairwiseOnDemand]: 319/324 looper letters, 197 selfloop transitions, 4 changer transitions 11/435 dead transitions. [2023-11-30 03:30:05,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 435 transitions, 2819 flow [2023-11-30 03:30:05,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:30:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:30:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1680 transitions. [2023-11-30 03:30:05,395 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8641975308641975 [2023-11-30 03:30:05,395 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1680 transitions. [2023-11-30 03:30:05,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1680 transitions. [2023-11-30 03:30:05,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:05,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1680 transitions. [2023-11-30 03:30:05,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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:05,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 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:05,416 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 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:05,416 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 7 predicate places. [2023-11-30 03:30:05,417 INFO L500 AbstractCegarLoop]: Abstraction has has 299 places, 435 transitions, 2819 flow [2023-11-30 03:30:05,417 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 267.8333333333333) internal successors, (1607), 6 states have internal predecessors, (1607), 0 states have call successors, (0), 0 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:05,417 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:05,417 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:05,417 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:30:05,417 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:30:05,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:05,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1895007560, now seen corresponding path program 1 times [2023-11-30 03:30:05,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:05,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671623248] [2023-11-30 03:30:05,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:05,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:05,740 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:05,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:05,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671623248] [2023-11-30 03:30:05,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671623248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:05,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:05,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:30:05,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136195465] [2023-11-30 03:30:05,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:05,741 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:30:05,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:05,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:30:05,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:30:05,743 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 324 [2023-11-30 03:30:05,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 435 transitions, 2819 flow. Second operand has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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:05,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:05,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 324 [2023-11-30 03:30:05,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:07,426 INFO L124 PetriNetUnfolderBase]: 5394/12926 cut-off events. [2023-11-30 03:30:07,426 INFO L125 PetriNetUnfolderBase]: For 28564/40618 co-relation queries the response was YES. [2023-11-30 03:30:07,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47735 conditions, 12926 events. 5394/12926 cut-off events. For 28564/40618 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 109435 event pairs, 1388 based on Foata normal form. 1/11422 useless extension candidates. Maximal degree in co-relation 46293. Up to 6287 conditions per place. [2023-11-30 03:30:07,559 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 434 selfloop transitions, 42 changer transitions 11/701 dead transitions. [2023-11-30 03:30:07,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 701 transitions, 6005 flow [2023-11-30 03:30:07,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:30:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:30:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1698 transitions. [2023-11-30 03:30:07,563 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8734567901234568 [2023-11-30 03:30:07,563 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1698 transitions. [2023-11-30 03:30:07,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1698 transitions. [2023-11-30 03:30:07,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:07,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1698 transitions. [2023-11-30 03:30:07,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 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,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 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,569 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 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,569 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 11 predicate places. [2023-11-30 03:30:07,569 INFO L500 AbstractCegarLoop]: Abstraction has has 303 places, 701 transitions, 6005 flow [2023-11-30 03:30:07,569 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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,569 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:07,569 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:07,570 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 03:30:07,570 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:30:07,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash 703642796, now seen corresponding path program 1 times [2023-11-30 03:30:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:07,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972335639] [2023-11-30 03:30:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:07,790 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,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:07,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972335639] [2023-11-30 03:30:07,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972335639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:07,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:07,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 03:30:07,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098697055] [2023-11-30 03:30:07,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:07,791 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 03:30:07,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 03:30:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 03:30:07,792 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 324 [2023-11-30 03:30:07,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 701 transitions, 6005 flow. Second operand has 4 states, 4 states have (on average 285.25) internal successors, (1141), 4 states have internal predecessors, (1141), 0 states have call successors, (0), 0 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,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:07,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 324 [2023-11-30 03:30:07,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:10,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 213#L64-1true, 352#true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, thread1Thread1of1ForFork0InUse, 384#true, thread2Thread1of1ForFork1InUse, 377#true, 327#(= |#race~size~0| 0), 228#L83-4true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:10,671 INFO L294 olderBase$Statistics]: this new event has 265 ancestors and is cut-off event [2023-11-30 03:30:10,671 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 03:30:10,671 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-30 03:30:10,671 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2023-11-30 03:30:10,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 336#true, 361#(= |#race~f~0| 0), 370#true, 2#L51-1true, 352#true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, thread1Thread1of1ForFork0InUse, 198#L64-2true, 384#true, thread2Thread1of1ForFork1InUse, 377#true, 327#(= |#race~size~0| 0), 228#L83-4true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:10,673 INFO L294 olderBase$Statistics]: this new event has 266 ancestors and is cut-off event [2023-11-30 03:30:10,673 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 03:30:10,673 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2023-11-30 03:30:10,673 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-30 03:30:10,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 213#L64-1true, 352#true, 321#true, 363#true, 329#true, 146#L84-1true, 346#(= |#race~x1~0| 0), 317#true, thread1Thread1of1ForFork0InUse, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:10,675 INFO L294 olderBase$Statistics]: this new event has 268 ancestors and is cut-off event [2023-11-30 03:30:10,675 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2023-11-30 03:30:10,675 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-30 03:30:10,675 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-30 03:30:10,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 336#true, 361#(= |#race~f~0| 0), 370#true, 2#L51-1true, 352#true, 321#true, 363#true, 329#true, 146#L84-1true, 346#(= |#race~x1~0| 0), 317#true, thread1Thread1of1ForFork0InUse, 198#L64-2true, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:10,676 INFO L294 olderBase$Statistics]: this new event has 269 ancestors and is cut-off event [2023-11-30 03:30:10,676 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2023-11-30 03:30:10,676 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-30 03:30:10,676 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 03:30:10,680 INFO L124 PetriNetUnfolderBase]: 7959/18233 cut-off events. [2023-11-30 03:30:10,680 INFO L125 PetriNetUnfolderBase]: For 61826/76033 co-relation queries the response was YES. [2023-11-30 03:30:10,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74296 conditions, 18233 events. 7959/18233 cut-off events. For 61826/76033 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 153082 event pairs, 2111 based on Foata normal form. 17/16212 useless extension candidates. Maximal degree in co-relation 72774. Up to 9418 conditions per place. [2023-11-30 03:30:10,839 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 577 selfloop transitions, 6 changer transitions 12/894 dead transitions. [2023-11-30 03:30:10,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 894 transitions, 9199 flow [2023-11-30 03:30:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 03:30:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 03:30:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1457 transitions. [2023-11-30 03:30:10,842 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8993827160493827 [2023-11-30 03:30:10,842 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1457 transitions. [2023-11-30 03:30:10,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1457 transitions. [2023-11-30 03:30:10,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:10,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1457 transitions. [2023-11-30 03:30:10,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 291.4) internal successors, (1457), 5 states have internal predecessors, (1457), 0 states have call successors, (0), 0 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:10,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 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:10,847 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 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:10,847 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 15 predicate places. [2023-11-30 03:30:10,847 INFO L500 AbstractCegarLoop]: Abstraction has has 307 places, 894 transitions, 9199 flow [2023-11-30 03:30:10,847 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 285.25) internal successors, (1141), 4 states have internal predecessors, (1141), 0 states have call successors, (0), 0 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:10,847 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:10,848 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:10,848 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 03:30:10,848 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:30:10,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:10,848 INFO L85 PathProgramCache]: Analyzing trace with hash 387226571, now seen corresponding path program 1 times [2023-11-30 03:30:10,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:10,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440484915] [2023-11-30 03:30:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:10,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:10,872 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:10,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:10,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440484915] [2023-11-30 03:30:10,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440484915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:10,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:10,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:10,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78077746] [2023-11-30 03:30:10,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:10,873 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:10,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:10,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:10,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:10,874 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 324 [2023-11-30 03:30:10,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 894 transitions, 9199 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 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:10,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:10,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 324 [2023-11-30 03:30:10,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:13,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 213#L64-1true, 352#true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 228#L83-4true, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:13,884 INFO L294 olderBase$Statistics]: this new event has 265 ancestors and is cut-off event [2023-11-30 03:30:13,884 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 03:30:13,884 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2023-11-30 03:30:13,884 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-30 03:30:13,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 336#true, 361#(= |#race~f~0| 0), 370#true, 2#L51-1true, 352#true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 198#L64-2true, 377#true, thread2Thread1of1ForFork1InUse, 228#L83-4true, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:13,885 INFO L294 olderBase$Statistics]: this new event has 266 ancestors and is cut-off event [2023-11-30 03:30:13,885 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2023-11-30 03:30:13,885 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 03:30:13,885 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-30 03:30:13,887 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 213#L64-1true, 352#true, 321#true, 363#true, 146#L84-1true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:13,887 INFO L294 olderBase$Statistics]: this new event has 268 ancestors and is cut-off event [2023-11-30 03:30:13,887 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-30 03:30:13,887 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2023-11-30 03:30:13,887 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-30 03:30:13,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 352#true, 321#true, 363#true, 146#L84-1true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 198#L64-2true, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:13,888 INFO L294 olderBase$Statistics]: this new event has 269 ancestors and is cut-off event [2023-11-30 03:30:13,888 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 03:30:13,888 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-30 03:30:13,888 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2023-11-30 03:30:13,892 INFO L124 PetriNetUnfolderBase]: 7960/18215 cut-off events. [2023-11-30 03:30:13,892 INFO L125 PetriNetUnfolderBase]: For 114659/150912 co-relation queries the response was YES. [2023-11-30 03:30:13,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74963 conditions, 18215 events. 7960/18215 cut-off events. For 114659/150912 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 152683 event pairs, 2111 based on Foata normal form. 3/16199 useless extension candidates. Maximal degree in co-relation 73336. Up to 9419 conditions per place. [2023-11-30 03:30:14,043 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 38 selfloop transitions, 2 changer transitions 12/894 dead transitions. [2023-11-30 03:30:14,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 894 transitions, 9320 flow [2023-11-30 03:30:14,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2023-11-30 03:30:14,044 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2023-11-30 03:30:14,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 891 transitions. [2023-11-30 03:30:14,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 891 transitions. [2023-11-30 03:30:14,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:14,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 891 transitions. [2023-11-30 03:30:14,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 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:14,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:14,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:14,047 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 16 predicate places. [2023-11-30 03:30:14,048 INFO L500 AbstractCegarLoop]: Abstraction has has 308 places, 894 transitions, 9320 flow [2023-11-30 03:30:14,048 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 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:14,048 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:14,048 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:14,048 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:30:14,048 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:30:14,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:14,048 INFO L85 PathProgramCache]: Analyzing trace with hash -486820096, now seen corresponding path program 1 times [2023-11-30 03:30:14,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:14,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999638534] [2023-11-30 03:30:14,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:14,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:14,255 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:14,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:14,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999638534] [2023-11-30 03:30:14,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999638534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:14,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:14,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:30:14,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296173406] [2023-11-30 03:30:14,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:14,257 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:30:14,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:14,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:30:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:30:14,258 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 324 [2023-11-30 03:30:14,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 894 transitions, 9320 flow. Second operand has 6 states, 6 states have (on average 261.1666666666667) internal successors, (1567), 6 states have internal predecessors, (1567), 0 states have call successors, (0), 0 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:14,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:14,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 324 [2023-11-30 03:30:14,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:17,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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, 350#(= |#race~x2~0| 0), 336#true, 361#(= |#race~f~0| 0), 370#true, 2#L51-1true, 213#L64-1true, 352#true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 228#L83-4true, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:17,977 INFO L294 olderBase$Statistics]: this new event has 265 ancestors and is cut-off event [2023-11-30 03:30:17,977 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-30 03:30:17,977 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2023-11-30 03:30:17,977 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 03:30:17,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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, 350#(= |#race~x2~0| 0), 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 352#true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 198#L64-2true, 377#true, thread2Thread1of1ForFork1InUse, 228#L83-4true, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:17,979 INFO L294 olderBase$Statistics]: this new event has 266 ancestors and is cut-off event [2023-11-30 03:30:17,979 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-30 03:30:17,979 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 03:30:17,979 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2023-11-30 03:30:17,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 213#L64-1true, 352#true, 321#true, 363#true, 329#true, 146#L84-1true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:17,983 INFO L294 olderBase$Statistics]: this new event has 268 ancestors and is cut-off event [2023-11-30 03:30:17,983 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-30 03:30:17,983 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-30 03:30:17,983 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2023-11-30 03:30:17,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 352#true, 321#true, 363#true, 329#true, 146#L84-1true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 198#L64-2true, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:17,985 INFO L294 olderBase$Statistics]: this new event has 269 ancestors and is cut-off event [2023-11-30 03:30:17,985 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 03:30:17,985 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2023-11-30 03:30:17,985 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-30 03:30:17,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 321#true, 363#true, 125#L84-5true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 357#(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)), thread2Thread1of1ForFork1InUse, 377#true, 327#(= |#race~size~0| 0), 188#L61-1true, 342#(= |#race~n~0| 0), 23#L51-5true]) [2023-11-30 03:30:17,997 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2023-11-30 03:30:17,997 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 03:30:17,997 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 03:30:17,997 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-30 03:30:17,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 36#L84-6true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 357#(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)), 377#true, thread2Thread1of1ForFork1InUse, 327#(= |#race~size~0| 0), 188#L61-1true, 342#(= |#race~n~0| 0), 23#L51-5true]) [2023-11-30 03:30:17,997 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2023-11-30 03:30:17,997 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2023-11-30 03:30:17,997 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 03:30:17,997 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:17,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 321#true, 363#true, 219#L84-4true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, thread2Thread1of1ForFork1InUse, 377#true, 356#(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)), 327#(= |#race~size~0| 0), 188#L61-1true, 23#L51-5true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:17,998 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-30 03:30:17,998 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2023-11-30 03:30:17,998 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-30 03:30:17,998 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2023-11-30 03:30:17,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 84#L61-2true, 321#true, 363#true, 125#L84-5true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 357#(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)), 377#true, thread2Thread1of1ForFork1InUse, 327#(= |#race~size~0| 0), 23#L51-5true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:17,998 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2023-11-30 03:30:17,998 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:17,998 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 03:30:17,999 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2023-11-30 03:30:17,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 84#L61-2true, 321#true, 363#true, 219#L84-4true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, thread2Thread1of1ForFork1InUse, 356#(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)), 377#true, 327#(= |#race~size~0| 0), 23#L51-5true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:17,999 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2023-11-30 03:30:17,999 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-30 03:30:17,999 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 03:30:17,999 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 03:30:17,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 84#L61-2true, 36#L84-6true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 357#(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)), 327#(= |#race~size~0| 0), 23#L51-5true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:17,999 INFO L294 olderBase$Statistics]: this new event has 281 ancestors and is cut-off event [2023-11-30 03:30:17,999 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 03:30:17,999 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:17,999 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2023-11-30 03:30:17,999 INFO L124 PetriNetUnfolderBase]: 9520/20989 cut-off events. [2023-11-30 03:30:17,999 INFO L125 PetriNetUnfolderBase]: For 87771/129188 co-relation queries the response was YES. [2023-11-30 03:30:18,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93542 conditions, 20989 events. 9520/20989 cut-off events. For 87771/129188 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 174407 event pairs, 2970 based on Foata normal form. 1/18813 useless extension candidates. Maximal degree in co-relation 91826. Up to 9476 conditions per place. [2023-11-30 03:30:18,210 INFO L140 encePairwiseOnDemand]: 312/324 looper letters, 572 selfloop transitions, 351 changer transitions 12/1151 dead transitions. [2023-11-30 03:30:18,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1151 transitions, 14338 flow [2023-11-30 03:30:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:30:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:30:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1670 transitions. [2023-11-30 03:30:18,213 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8590534979423868 [2023-11-30 03:30:18,213 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1670 transitions. [2023-11-30 03:30:18,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1670 transitions. [2023-11-30 03:30:18,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:18,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1670 transitions. [2023-11-30 03:30:18,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 278.3333333333333) internal successors, (1670), 6 states have internal predecessors, (1670), 0 states have call successors, (0), 0 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:18,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 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:18,218 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 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:18,218 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 19 predicate places. [2023-11-30 03:30:18,219 INFO L500 AbstractCegarLoop]: Abstraction has has 311 places, 1151 transitions, 14338 flow [2023-11-30 03:30:18,219 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 261.1666666666667) internal successors, (1567), 6 states have internal predecessors, (1567), 0 states have call successors, (0), 0 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:18,219 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:18,219 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:18,219 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 03:30:18,219 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:30:18,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 30869315, now seen corresponding path program 1 times [2023-11-30 03:30:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:18,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345225543] [2023-11-30 03:30:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:18,249 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:18,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:18,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345225543] [2023-11-30 03:30:18,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345225543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:18,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:18,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:18,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954755047] [2023-11-30 03:30:18,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:18,250 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:18,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:18,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:18,251 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 324 [2023-11-30 03:30:18,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 1151 transitions, 14338 flow. Second operand has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 0 states have call successors, (0), 0 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:18,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:18,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 324 [2023-11-30 03:30:18,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:21,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 213#L64-1true, 352#true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, thread2Thread1of1ForFork1InUse, 377#true, 327#(= |#race~size~0| 0), 228#L83-4true, 402#true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:21,928 INFO L294 olderBase$Statistics]: this new event has 265 ancestors and is cut-off event [2023-11-30 03:30:21,928 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-30 03:30:21,928 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 03:30:21,928 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2023-11-30 03:30:21,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 352#true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 198#L64-2true, thread2Thread1of1ForFork1InUse, 377#true, 327#(= |#race~size~0| 0), 228#L83-4true, 402#true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:21,930 INFO L294 olderBase$Statistics]: this new event has 266 ancestors and is cut-off event [2023-11-30 03:30:21,930 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2023-11-30 03:30:21,930 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 03:30:21,930 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-30 03:30:21,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 213#L64-1true, 352#true, 321#true, 363#true, 329#true, 146#L84-1true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, thread2Thread1of1ForFork1InUse, 377#true, 327#(= |#race~size~0| 0), 402#true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:21,933 INFO L294 olderBase$Statistics]: this new event has 268 ancestors and is cut-off event [2023-11-30 03:30:21,933 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2023-11-30 03:30:21,934 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-30 03:30:21,934 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-30 03:30:21,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 352#true, 321#true, 363#true, 329#true, 146#L84-1true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 198#L64-2true, thread2Thread1of1ForFork1InUse, 377#true, 327#(= |#race~size~0| 0), 402#true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:21,935 INFO L294 olderBase$Statistics]: this new event has 269 ancestors and is cut-off event [2023-11-30 03:30:21,935 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 03:30:21,936 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2023-11-30 03:30:21,936 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-30 03:30:21,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 36#L84-6true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, thread2Thread1of1ForFork1InUse, 357#(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)), 377#true, 402#true, 327#(= |#race~size~0| 0), 188#L61-1true, 23#L51-5true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:21,952 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2023-11-30 03:30:21,952 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 03:30:21,952 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2023-11-30 03:30:21,952 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:21,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 321#true, 219#L84-4true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 356#(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)), 402#true, 327#(= |#race~size~0| 0), 188#L61-1true, 342#(= |#race~n~0| 0), 23#L51-5true]) [2023-11-30 03:30:21,952 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-30 03:30:21,952 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2023-11-30 03:30:21,952 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-30 03:30:21,952 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2023-11-30 03:30:21,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 321#true, 363#true, 125#L84-5true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 357#(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)), thread2Thread1of1ForFork1InUse, 377#true, 402#true, 327#(= |#race~size~0| 0), 188#L61-1true, 23#L51-5true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:21,952 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2023-11-30 03:30:21,952 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-30 03:30:21,953 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 03:30:21,953 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 03:30:21,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 84#L61-2true, 321#true, 363#true, 219#L84-4true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 356#(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)), 402#true, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0), 23#L51-5true]) [2023-11-30 03:30:21,953 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2023-11-30 03:30:21,953 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 03:30:21,953 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-30 03:30:21,953 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 03:30:21,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 84#L61-2true, 321#true, 363#true, 125#L84-5true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, thread2Thread1of1ForFork1InUse, 377#true, 357#(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)), 402#true, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0), 23#L51-5true]) [2023-11-30 03:30:21,953 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2023-11-30 03:30:21,953 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:21,953 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2023-11-30 03:30:21,954 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 03:30:21,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 84#L61-2true, 36#L84-6true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, thread2Thread1of1ForFork1InUse, 377#true, 357#(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)), 402#true, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0), 23#L51-5true]) [2023-11-30 03:30:21,954 INFO L294 olderBase$Statistics]: this new event has 281 ancestors and is cut-off event [2023-11-30 03:30:21,954 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2023-11-30 03:30:21,954 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 03:30:21,954 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:21,954 INFO L124 PetriNetUnfolderBase]: 9526/20945 cut-off events. [2023-11-30 03:30:21,954 INFO L125 PetriNetUnfolderBase]: For 113159/155675 co-relation queries the response was YES. [2023-11-30 03:30:22,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94626 conditions, 20945 events. 9526/20945 cut-off events. For 113159/155675 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 173959 event pairs, 2958 based on Foata normal form. 5/18800 useless extension candidates. Maximal degree in co-relation 92848. Up to 9462 conditions per place. [2023-11-30 03:30:22,176 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 65 selfloop transitions, 2 changer transitions 12/1152 dead transitions. [2023-11-30 03:30:22,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1152 transitions, 14552 flow [2023-11-30 03:30:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 863 transitions. [2023-11-30 03:30:22,178 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8878600823045267 [2023-11-30 03:30:22,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 863 transitions. [2023-11-30 03:30:22,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 863 transitions. [2023-11-30 03:30:22,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:22,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 863 transitions. [2023-11-30 03:30:22,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 287.6666666666667) internal successors, (863), 3 states have internal predecessors, (863), 0 states have call successors, (0), 0 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:22,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:22,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:22,181 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 20 predicate places. [2023-11-30 03:30:22,181 INFO L500 AbstractCegarLoop]: Abstraction has has 312 places, 1152 transitions, 14552 flow [2023-11-30 03:30:22,181 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 0 states have call successors, (0), 0 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:22,181 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:30:22,181 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:22,181 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 03:30:22,181 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2023-11-30 03:30:22,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:30:22,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1366308838, now seen corresponding path program 1 times [2023-11-30 03:30:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:30:22,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409259854] [2023-11-30 03:30:22,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:30:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:30:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:30:22,211 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:22,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:30:22,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409259854] [2023-11-30 03:30:22,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409259854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:30:22,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:30:22,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 03:30:22,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781236365] [2023-11-30 03:30:22,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:30:22,212 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 03:30:22,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:30:22,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 03:30:22,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 03:30:22,213 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 324 [2023-11-30 03:30:22,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 1152 transitions, 14552 flow. Second operand has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 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:22,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:30:22,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 324 [2023-11-30 03:30:22,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:30:26,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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, 350#(= |#race~x2~0| 0), 336#true, 361#(= |#race~f~0| 0), 370#true, 2#L51-1true, 213#L64-1true, 352#true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, thread2Thread1of1ForFork1InUse, 377#true, 402#true, 327#(= |#race~size~0| 0), 228#L83-4true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:26,113 INFO L294 olderBase$Statistics]: this new event has 265 ancestors and is cut-off event [2023-11-30 03:30:26,113 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 03:30:26,113 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2023-11-30 03:30:26,113 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2023-11-30 03:30:26,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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, 350#(= |#race~x2~0| 0), 336#true, 361#(= |#race~f~0| 0), 370#true, 2#L51-1true, 352#true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 198#L64-2true, thread2Thread1of1ForFork1InUse, 377#true, 402#true, 327#(= |#race~size~0| 0), 228#L83-4true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:26,115 INFO L294 olderBase$Statistics]: this new event has 266 ancestors and is cut-off event [2023-11-30 03:30:26,115 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 03:30:26,115 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2023-11-30 03:30:26,115 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2023-11-30 03:30:26,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 406#true, 395#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 2#L51-1true, 213#L64-1true, 352#true, 321#true, 363#true, 329#true, 146#L84-1true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 402#true, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:26,118 INFO L294 olderBase$Statistics]: this new event has 268 ancestors and is cut-off event [2023-11-30 03:30:26,118 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2023-11-30 03:30:26,118 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2023-11-30 03:30:26,118 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-30 03:30:26,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([751] 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], [350#(= |#race~x2~0| 0), 406#true, 395#true, 336#true, 370#true, 361#(= |#race~f~0| 0), 2#L51-1true, 352#true, 321#true, 363#true, 329#true, 146#L84-1true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 198#L64-2true, 384#true, 377#true, thread2Thread1of1ForFork1InUse, 402#true, 327#(= |#race~size~0| 0), 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:26,120 INFO L294 olderBase$Statistics]: this new event has 269 ancestors and is cut-off event [2023-11-30 03:30:26,120 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2023-11-30 03:30:26,120 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 03:30:26,120 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-30 03:30:26,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 406#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 36#L84-6true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 377#true, 357#(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)), thread2Thread1of1ForFork1InUse, 402#true, 327#(= |#race~size~0| 0), 188#L61-1true, 342#(= |#race~n~0| 0), 23#L51-5true]) [2023-11-30 03:30:26,132 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2023-11-30 03:30:26,132 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 03:30:26,132 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:26,132 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2023-11-30 03:30:26,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 406#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 321#true, 363#true, 125#L84-5true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 357#(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)), 377#true, thread2Thread1of1ForFork1InUse, 402#true, 327#(= |#race~size~0| 0), 188#L61-1true, 342#(= |#race~n~0| 0), 23#L51-5true]) [2023-11-30 03:30:26,133 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2023-11-30 03:30:26,133 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 03:30:26,133 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-30 03:30:26,133 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 03:30:26,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [395#true, 350#(= |#race~x2~0| 0), 406#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 321#true, 219#L84-4true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 356#(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)), 377#true, thread2Thread1of1ForFork1InUse, 402#true, 327#(= |#race~size~0| 0), 188#L61-1true, 342#(= |#race~n~0| 0), 23#L51-5true]) [2023-11-30 03:30:26,133 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-30 03:30:26,133 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2023-11-30 03:30:26,133 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2023-11-30 03:30:26,133 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-30 03:30:26,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 406#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 84#L61-2true, 321#true, 363#true, 125#L84-5true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 357#(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)), 377#true, thread2Thread1of1ForFork1InUse, 402#true, 327#(= |#race~size~0| 0), 23#L51-5true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:26,134 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 406#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 84#L61-2true, 321#true, 219#L84-4true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 356#(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)), 377#true, thread2Thread1of1ForFork1InUse, 402#true, 327#(= |#race~size~0| 0), 23#L51-5true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:26,134 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([757] 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], [350#(= |#race~x2~0| 0), 395#true, 406#true, 336#true, 361#(= |#race~f~0| 0), 370#true, 84#L61-2true, 36#L84-6true, 321#true, 363#true, 329#true, 346#(= |#race~x1~0| 0), 317#true, 391#true, thread1Thread1of1ForFork0InUse, 384#true, 357#(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)), 377#true, thread2Thread1of1ForFork1InUse, 402#true, 327#(= |#race~size~0| 0), 23#L51-5true, 342#(= |#race~n~0| 0)]) [2023-11-30 03:30:26,134 INFO L294 olderBase$Statistics]: this new event has 281 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-30 03:30:26,134 INFO L124 PetriNetUnfolderBase]: 9528/20909 cut-off events. [2023-11-30 03:30:26,134 INFO L125 PetriNetUnfolderBase]: For 139736/182807 co-relation queries the response was YES. [2023-11-30 03:30:26,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95711 conditions, 20909 events. 9528/20909 cut-off events. For 139736/182807 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 173115 event pairs, 2959 based on Foata normal form. 7/18803 useless extension candidates. Maximal degree in co-relation 93871. Up to 9464 conditions per place. [2023-11-30 03:30:26,260 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 0 selfloop transitions, 0 changer transitions 1153/1153 dead transitions. [2023-11-30 03:30:26,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 1153 transitions, 14770 flow [2023-11-30 03:30:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 03:30:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 03:30:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2023-11-30 03:30:26,262 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8868312757201646 [2023-11-30 03:30:26,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 862 transitions. [2023-11-30 03:30:26,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 862 transitions. [2023-11-30 03:30:26,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:30:26,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 862 transitions. [2023-11-30 03:30:26,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 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:26,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:26,265 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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:26,265 INFO L307 CegarLoopForPetriNet]: 292 programPoint places, 21 predicate places. [2023-11-30 03:30:26,265 INFO L500 AbstractCegarLoop]: Abstraction has has 313 places, 1153 transitions, 14770 flow [2023-11-30 03:30:26,265 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 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:26,272 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/unroll-2.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 03:30:26,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (58 of 59 remaining) [2023-11-30 03:30:26,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (57 of 59 remaining) [2023-11-30 03:30:26,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (56 of 59 remaining) [2023-11-30 03:30:26,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (55 of 59 remaining) [2023-11-30 03:30:26,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (54 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (53 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (52 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (51 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (50 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (49 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (48 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (47 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (46 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (44 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (43 of 59 remaining) [2023-11-30 03:30:26,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (42 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (41 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (40 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (39 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (38 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (37 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (36 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 59 remaining) [2023-11-30 03:30:26,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (21 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (19 of 59 remaining) [2023-11-30 03:30:26,327 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (18 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (16 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (15 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (9 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (8 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 59 remaining) [2023-11-30 03:30:26,328 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 59 remaining) [2023-11-30 03:30:26,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (5 of 59 remaining) [2023-11-30 03:30:26,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (4 of 59 remaining) [2023-11-30 03:30:26,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (3 of 59 remaining) [2023-11-30 03:30:26,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (2 of 59 remaining) [2023-11-30 03:30:26,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (1 of 59 remaining) [2023-11-30 03:30:26,329 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (0 of 59 remaining) [2023-11-30 03:30:26,329 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 03:30:26,329 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:30:26,333 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 03:30:26,333 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:30:26,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:30:26 BasicIcfg [2023-11-30 03:30:26,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:30:26,338 INFO L158 Benchmark]: Toolchain (without parser) took 37217.27ms. Allocated memory was 444.6MB in the beginning and 12.0GB in the end (delta: 11.5GB). Free memory was 396.0MB in the beginning and 9.6GB in the end (delta: -9.2GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. [2023-11-30 03:30:26,338 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 335.5MB. Free memory was 287.1MB in the beginning and 286.9MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:30:26,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.02ms. Allocated memory is still 444.6MB. Free memory was 395.8MB in the beginning and 383.5MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-11-30 03:30:26,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.76ms. Allocated memory is still 444.6MB. Free memory was 383.5MB in the beginning and 380.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 03:30:26,338 INFO L158 Benchmark]: Boogie Preprocessor took 42.71ms. Allocated memory is still 444.6MB. Free memory was 380.7MB in the beginning and 378.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:30:26,339 INFO L158 Benchmark]: RCFGBuilder took 413.40ms. Allocated memory is still 444.6MB. Free memory was 378.3MB in the beginning and 394.3MB in the end (delta: -16.0MB). Peak memory consumption was 15.8MB. Max. memory is 16.0GB. [2023-11-30 03:30:26,339 INFO L158 Benchmark]: TraceAbstraction took 36538.55ms. Allocated memory was 444.6MB in the beginning and 12.0GB in the end (delta: 11.5GB). Free memory was 393.1MB in the beginning and 9.6GB in the end (delta: -9.2GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. [2023-11-30 03:30:26,340 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.11ms. Allocated memory is still 335.5MB. Free memory was 287.1MB in the beginning and 286.9MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 187.02ms. Allocated memory is still 444.6MB. Free memory was 395.8MB in the beginning and 383.5MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 31.76ms. Allocated memory is still 444.6MB. Free memory was 383.5MB in the beginning and 380.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.71ms. Allocated memory is still 444.6MB. Free memory was 380.7MB in the beginning and 378.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 413.40ms. Allocated memory is still 444.6MB. Free memory was 378.3MB in the beginning and 394.3MB in the end (delta: -16.0MB). Peak memory consumption was 15.8MB. Max. memory is 16.0GB. * TraceAbstraction took 36538.55ms. Allocated memory was 444.6MB in the beginning and 12.0GB in the end (delta: 11.5GB). Free memory was 393.1MB in the beginning and 9.6GB in the end (delta: -9.2GB). Peak memory consumption was 3.8GB. 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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: 99]: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: 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: 87]: 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, 457 locations, 59 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: 36.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 349 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1284 IncrementalHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 327 mSDtfsCounter, 1284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14770occurred in iteration=18, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1656 NumberOfCodeBlocks, 1656 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1638 ConstructedInterpolants, 0 QuantifiedInterpolants, 2513 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 03:30:26,355 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...