/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/chl-time-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 02:58:38,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 02:58:38,865 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 02:58:38,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 02:58:38,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 02:58:38,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 02:58:38,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 02:58:38,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 02:58:38,892 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 02:58:38,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 02:58:38,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 02:58:38,895 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 02:58:38,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 02:58:38,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 02:58:38,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 02:58:38,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 02:58:38,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 02:58:38,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 02:58:38,897 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 02:58:38,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 02:58:38,897 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 02:58:38,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 02:58:38,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 02:58:38,898 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 02:58:38,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 02:58:38,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 02:58:38,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 02:58:38,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 02:58:38,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 02:58:38,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 02:58:38,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 02:58:38,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 02:58:38,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 02:58:38,901 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 02:58:39,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 02:58:39,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 02:58:39,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 02:58:39,108 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 02:58:39,108 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 02:58:39,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-time-symm.wvr.c [2023-11-30 02:58:40,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 02:58:40,396 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 02:58:40,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-symm.wvr.c [2023-11-30 02:58:40,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/107c85786/6b7fd6c129a94e8e8c02fb609d0230a5/FLAG17237dd01 [2023-11-30 02:58:40,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/107c85786/6b7fd6c129a94e8e8c02fb609d0230a5 [2023-11-30 02:58:40,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 02:58:40,416 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 02:58:40,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 02:58:40,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 02:58:40,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 02:58:40,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a5e8ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40, skipping insertion in model container [2023-11-30 02:58:40,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,439 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 02:58:40,586 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 02:58:40,593 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 02:58:40,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 02:58:40,615 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 02:58:40,615 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 02:58:40,620 INFO L206 MainTranslator]: Completed translation [2023-11-30 02:58:40,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40 WrapperNode [2023-11-30 02:58:40,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 02:58:40,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 02:58:40,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 02:58:40,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 02:58:40,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,655 INFO L138 Inliner]: procedures = 22, calls = 30, calls flagged for inlining = 10, calls inlined = 16, statements flattened = 247 [2023-11-30 02:58:40,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 02:58:40,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 02:58:40,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 02:58:40,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 02:58:40,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 02:58:40,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 02:58:40,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 02:58:40,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 02:58:40,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (1/1) ... [2023-11-30 02:58:40,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 02:58:40,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 02:58:40,713 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 02:58:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 02:58:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 02:58:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 02:58:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 02:58:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 02:58:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 02:58:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 02:58:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 02:58:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 02:58:40,729 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 02:58:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 02:58:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 02:58:40,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 02:58:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 02:58:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 02:58:40,760 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 02:58:40,874 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 02:58:40,875 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 02:58:41,196 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 02:58:41,421 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 02:58:41,421 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 02:58:41,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:58:41 BoogieIcfgContainer [2023-11-30 02:58:41,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 02:58:41,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 02:58:41,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 02:58:41,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 02:58:41,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:58:40" (1/3) ... [2023-11-30 02:58:41,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1817e778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:58:41, skipping insertion in model container [2023-11-30 02:58:41,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:58:40" (2/3) ... [2023-11-30 02:58:41,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1817e778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:58:41, skipping insertion in model container [2023-11-30 02:58:41,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:58:41" (3/3) ... [2023-11-30 02:58:41,430 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-time-symm.wvr.c [2023-11-30 02:58:41,443 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 02:58:41,443 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2023-11-30 02:58:41,443 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 02:58:41,496 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 02:58:41,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 168 transitions, 350 flow [2023-11-30 02:58:41,604 INFO L124 PetriNetUnfolderBase]: 3/166 cut-off events. [2023-11-30 02:58:41,605 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 02:58:41,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 166 events. 3/166 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 121 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-11-30 02:58:41,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 168 transitions, 350 flow [2023-11-30 02:58:41,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 140 transitions, 292 flow [2023-11-30 02:58:41,626 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 02:58:41,632 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;@64e60f67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 02:58:41,633 INFO L363 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2023-11-30 02:58:41,638 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 02:58:41,638 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-30 02:58:41,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 02:58:41,638 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:41,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] [2023-11-30 02:58:41,639 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-30 02:58:41,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:41,643 INFO L85 PathProgramCache]: Analyzing trace with hash -887577390, now seen corresponding path program 1 times [2023-11-30 02:58:41,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:41,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012331765] [2023-11-30 02:58:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:41,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:41,821 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 02:58:41,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:41,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012331765] [2023-11-30 02:58:41,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012331765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:41,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262963383] [2023-11-30 02:58:41,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:41,831 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:41,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:41,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:41,868 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 168 [2023-11-30 02:58:41,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 140 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:41,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:41,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 168 [2023-11-30 02:58:41,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:41,934 INFO L124 PetriNetUnfolderBase]: 4/141 cut-off events. [2023-11-30 02:58:41,934 INFO L125 PetriNetUnfolderBase]: For 14/20 co-relation queries the response was YES. [2023-11-30 02:58:41,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 141 events. 4/141 cut-off events. For 14/20 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 3 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 49. Up to 16 conditions per place. [2023-11-30 02:58:41,938 INFO L140 encePairwiseOnDemand]: 149/168 looper letters, 9 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2023-11-30 02:58:41,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 123 transitions, 280 flow [2023-11-30 02:58:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-11-30 02:58:41,953 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.871031746031746 [2023-11-30 02:58:41,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-11-30 02:58:41,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-11-30 02:58:41,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:41,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-11-30 02:58:41,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:41,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:41,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:41,969 INFO L307 CegarLoopForPetriNet]: 146 programPoint places, -15 predicate places. [2023-11-30 02:58:41,970 INFO L500 AbstractCegarLoop]: Abstraction has has 131 places, 123 transitions, 280 flow [2023-11-30 02:58:41,970 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:41,970 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:41,971 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] [2023-11-30 02:58:41,971 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 02:58:41,971 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-30 02:58:41,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:41,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1269949550, now seen corresponding path program 1 times [2023-11-30 02:58:41,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:41,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517109528] [2023-11-30 02:58:41,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:41,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:42,034 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 02:58:42,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:42,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517109528] [2023-11-30 02:58:42,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517109528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:42,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505653783] [2023-11-30 02:58:42,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:42,036 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:42,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:42,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:42,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:42,038 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 168 [2023-11-30 02:58:42,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 123 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:42,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 168 [2023-11-30 02:58:42,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:42,087 INFO L124 PetriNetUnfolderBase]: 4/140 cut-off events. [2023-11-30 02:58:42,088 INFO L125 PetriNetUnfolderBase]: For 36/56 co-relation queries the response was YES. [2023-11-30 02:58:42,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 140 events. 4/140 cut-off events. For 36/56 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 3 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 56. Up to 16 conditions per place. [2023-11-30 02:58:42,088 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 9 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2023-11-30 02:58:42,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 122 transitions, 300 flow [2023-11-30 02:58:42,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:42,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-11-30 02:58:42,090 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2023-11-30 02:58:42,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-11-30 02:58:42,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-11-30 02:58:42,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:42,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-11-30 02:58:42,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,094 INFO L307 CegarLoopForPetriNet]: 146 programPoint places, -14 predicate places. [2023-11-30 02:58:42,094 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 122 transitions, 300 flow [2023-11-30 02:58:42,095 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,095 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:42,095 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] [2023-11-30 02:58:42,095 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 02:58:42,095 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-30 02:58:42,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1319077173, now seen corresponding path program 1 times [2023-11-30 02:58:42,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:42,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507374379] [2023-11-30 02:58:42,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:42,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:42,164 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 02:58:42,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:42,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507374379] [2023-11-30 02:58:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507374379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:42,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:42,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:42,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939670764] [2023-11-30 02:58:42,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:42,166 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:42,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:42,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:42,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:42,167 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 168 [2023-11-30 02:58:42,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 122 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:42,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 168 [2023-11-30 02:58:42,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:42,198 INFO L124 PetriNetUnfolderBase]: 4/139 cut-off events. [2023-11-30 02:58:42,198 INFO L125 PetriNetUnfolderBase]: For 69/103 co-relation queries the response was YES. [2023-11-30 02:58:42,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 139 events. 4/139 cut-off events. For 69/103 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 3 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 63. Up to 16 conditions per place. [2023-11-30 02:58:42,199 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 9 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2023-11-30 02:58:42,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 121 transitions, 320 flow [2023-11-30 02:58:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-11-30 02:58:42,201 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2023-11-30 02:58:42,201 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-11-30 02:58:42,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-11-30 02:58:42,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:42,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-11-30 02:58:42,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,204 INFO L307 CegarLoopForPetriNet]: 146 programPoint places, -13 predicate places. [2023-11-30 02:58:42,204 INFO L500 AbstractCegarLoop]: Abstraction has has 133 places, 121 transitions, 320 flow [2023-11-30 02:58:42,205 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,205 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:42,205 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] [2023-11-30 02:58:42,205 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 02:58:42,206 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-30 02:58:42,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:42,206 INFO L85 PathProgramCache]: Analyzing trace with hash 603241943, now seen corresponding path program 1 times [2023-11-30 02:58:42,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:42,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901133459] [2023-11-30 02:58:42,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:42,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:42,258 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 02:58:42,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:42,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901133459] [2023-11-30 02:58:42,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901133459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:42,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:42,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:42,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552700361] [2023-11-30 02:58:42,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:42,259 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:42,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:42,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:42,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:42,264 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 168 [2023-11-30 02:58:42,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 121 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:42,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 168 [2023-11-30 02:58:42,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:42,299 INFO L124 PetriNetUnfolderBase]: 4/138 cut-off events. [2023-11-30 02:58:42,299 INFO L125 PetriNetUnfolderBase]: For 113/161 co-relation queries the response was YES. [2023-11-30 02:58:42,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 138 events. 4/138 cut-off events. For 113/161 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 3 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 70. Up to 16 conditions per place. [2023-11-30 02:58:42,301 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 9 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2023-11-30 02:58:42,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 120 transitions, 340 flow [2023-11-30 02:58:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-11-30 02:58:42,302 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2023-11-30 02:58:42,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-11-30 02:58:42,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-11-30 02:58:42,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:42,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-11-30 02:58:42,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,306 INFO L307 CegarLoopForPetriNet]: 146 programPoint places, -12 predicate places. [2023-11-30 02:58:42,306 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 120 transitions, 340 flow [2023-11-30 02:58:42,306 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,306 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:42,306 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] [2023-11-30 02:58:42,306 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 02:58:42,306 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-30 02:58:42,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1621742471, now seen corresponding path program 1 times [2023-11-30 02:58:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:42,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370331865] [2023-11-30 02:58:42,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:42,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:42,333 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 02:58:42,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:42,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370331865] [2023-11-30 02:58:42,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370331865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:42,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:42,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:42,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379659956] [2023-11-30 02:58:42,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:42,334 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:42,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:42,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:42,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:42,335 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 168 [2023-11-30 02:58:42,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 120 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:42,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 168 [2023-11-30 02:58:42,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:42,362 INFO L124 PetriNetUnfolderBase]: 4/137 cut-off events. [2023-11-30 02:58:42,362 INFO L125 PetriNetUnfolderBase]: For 168/230 co-relation queries the response was YES. [2023-11-30 02:58:42,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 137 events. 4/137 cut-off events. For 168/230 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 3 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 77. Up to 22 conditions per place. [2023-11-30 02:58:42,363 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 15 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2023-11-30 02:58:42,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 119 transitions, 372 flow [2023-11-30 02:58:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-11-30 02:58:42,364 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2023-11-30 02:58:42,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-11-30 02:58:42,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-11-30 02:58:42,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:42,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-11-30 02:58:42,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,366 INFO L307 CegarLoopForPetriNet]: 146 programPoint places, -11 predicate places. [2023-11-30 02:58:42,366 INFO L500 AbstractCegarLoop]: Abstraction has has 135 places, 119 transitions, 372 flow [2023-11-30 02:58:42,367 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,367 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:42,367 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] [2023-11-30 02:58:42,367 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 02:58:42,367 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-30 02:58:42,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:42,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1031007004, now seen corresponding path program 1 times [2023-11-30 02:58:42,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:42,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644826454] [2023-11-30 02:58:42,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:42,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:42,391 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 02:58:42,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:42,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644826454] [2023-11-30 02:58:42,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644826454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:42,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:42,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:42,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649312401] [2023-11-30 02:58:42,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:42,392 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:42,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:42,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:42,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:42,393 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 168 [2023-11-30 02:58:42,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 119 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:42,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 168 [2023-11-30 02:58:42,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:42,421 INFO L124 PetriNetUnfolderBase]: 4/136 cut-off events. [2023-11-30 02:58:42,421 INFO L125 PetriNetUnfolderBase]: For 234/310 co-relation queries the response was YES. [2023-11-30 02:58:42,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 136 events. 4/136 cut-off events. For 234/310 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 3 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 84. Up to 22 conditions per place. [2023-11-30 02:58:42,421 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 14 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2023-11-30 02:58:42,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 118 transitions, 402 flow [2023-11-30 02:58:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-11-30 02:58:42,423 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8134920634920635 [2023-11-30 02:58:42,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-11-30 02:58:42,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-11-30 02:58:42,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:42,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-11-30 02:58:42,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,425 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,426 INFO L307 CegarLoopForPetriNet]: 146 programPoint places, -10 predicate places. [2023-11-30 02:58:42,426 INFO L500 AbstractCegarLoop]: Abstraction has has 136 places, 118 transitions, 402 flow [2023-11-30 02:58:42,426 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,426 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:42,426 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] [2023-11-30 02:58:42,426 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 02:58:42,426 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-30 02:58:42,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:42,427 INFO L85 PathProgramCache]: Analyzing trace with hash -866571904, now seen corresponding path program 1 times [2023-11-30 02:58:42,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:42,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241381021] [2023-11-30 02:58:42,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:42,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:42,798 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 02:58:42,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:42,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241381021] [2023-11-30 02:58:42,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241381021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:42,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:42,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:58:42,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487825061] [2023-11-30 02:58:42,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:42,799 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:58:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:42,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:58:42,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:58:42,800 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 168 [2023-11-30 02:58:42,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 118 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:42,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 168 [2023-11-30 02:58:42,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:42,905 INFO L124 PetriNetUnfolderBase]: 34/189 cut-off events. [2023-11-30 02:58:42,905 INFO L125 PetriNetUnfolderBase]: For 812/824 co-relation queries the response was YES. [2023-11-30 02:58:42,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 189 events. 34/189 cut-off events. For 812/824 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 297 event pairs, 6 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 390. Up to 52 conditions per place. [2023-11-30 02:58:42,909 INFO L140 encePairwiseOnDemand]: 163/168 looper letters, 25 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2023-11-30 02:58:42,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 125 transitions, 570 flow [2023-11-30 02:58:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:58:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:58:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2023-11-30 02:58:42,911 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7738095238095238 [2023-11-30 02:58:42,911 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 780 transitions. [2023-11-30 02:58:42,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 780 transitions. [2023-11-30 02:58:42,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:42,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 780 transitions. [2023-11-30 02:58:42,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,915 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,915 INFO L307 CegarLoopForPetriNet]: 146 programPoint places, -6 predicate places. [2023-11-30 02:58:42,916 INFO L500 AbstractCegarLoop]: Abstraction has has 140 places, 125 transitions, 570 flow [2023-11-30 02:58:42,916 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:42,916 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:42,916 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] [2023-11-30 02:58:42,916 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 02:58:42,917 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-30 02:58:42,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash 183647046, now seen corresponding path program 1 times [2023-11-30 02:58:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:42,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085991236] [2023-11-30 02:58:42,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:42,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:43,278 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 02:58:43,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:43,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085991236] [2023-11-30 02:58:43,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085991236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:43,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:43,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:58:43,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324623972] [2023-11-30 02:58:43,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:43,280 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:58:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:43,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:58:43,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:58:43,282 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 168 [2023-11-30 02:58:43,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 125 transitions, 570 flow. Second operand has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:43,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 168 [2023-11-30 02:58:43,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:43,356 INFO L124 PetriNetUnfolderBase]: 35/190 cut-off events. [2023-11-30 02:58:43,356 INFO L125 PetriNetUnfolderBase]: For 918/918 co-relation queries the response was YES. [2023-11-30 02:58:43,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 190 events. 35/190 cut-off events. For 918/918 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 299 event pairs, 7 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 387. Up to 64 conditions per place. [2023-11-30 02:58:43,357 INFO L140 encePairwiseOnDemand]: 163/168 looper letters, 28 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2023-11-30 02:58:43,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 128 transitions, 694 flow [2023-11-30 02:58:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 02:58:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 02:58:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2023-11-30 02:58:43,359 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7688492063492064 [2023-11-30 02:58:43,359 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 775 transitions. [2023-11-30 02:58:43,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 775 transitions. [2023-11-30 02:58:43,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:43,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 775 transitions. [2023-11-30 02:58:43,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,362 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,363 INFO L307 CegarLoopForPetriNet]: 146 programPoint places, -2 predicate places. [2023-11-30 02:58:43,364 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 128 transitions, 694 flow [2023-11-30 02:58:43,364 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,364 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:43,364 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 02:58:43,364 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 02:58:43,364 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-30 02:58:43,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:43,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1071338902, now seen corresponding path program 1 times [2023-11-30 02:58:43,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:43,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696032485] [2023-11-30 02:58:43,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:43,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:43,397 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 02:58:43,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:43,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696032485] [2023-11-30 02:58:43,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696032485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:43,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:43,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:43,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268415981] [2023-11-30 02:58:43,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:43,398 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:43,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:43,399 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2023-11-30 02:58:43,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 128 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:43,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2023-11-30 02:58:43,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:43,435 INFO L124 PetriNetUnfolderBase]: 35/188 cut-off events. [2023-11-30 02:58:43,435 INFO L125 PetriNetUnfolderBase]: For 1199/1199 co-relation queries the response was YES. [2023-11-30 02:58:43,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 188 events. 35/188 cut-off events. For 1199/1199 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 290 event pairs, 7 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 419. Up to 64 conditions per place. [2023-11-30 02:58:43,436 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 23 selfloop transitions, 1 changer transitions 0/126 dead transitions. [2023-11-30 02:58:43,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 126 transitions, 734 flow [2023-11-30 02:58:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-11-30 02:58:43,437 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8313492063492064 [2023-11-30 02:58:43,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-11-30 02:58:43,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-11-30 02:58:43,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:43,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-11-30 02:58:43,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,440 INFO L307 CegarLoopForPetriNet]: 146 programPoint places, -2 predicate places. [2023-11-30 02:58:43,440 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 126 transitions, 734 flow [2023-11-30 02:58:43,440 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,440 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:58:43,440 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] [2023-11-30 02:58:43,440 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 02:58:43,440 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2023-11-30 02:58:43,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:58:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1850594207, now seen corresponding path program 1 times [2023-11-30 02:58:43,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:58:43,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604314786] [2023-11-30 02:58:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:58:43,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:58:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:58:43,472 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 02:58:43,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:58:43,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604314786] [2023-11-30 02:58:43,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604314786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:58:43,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:58:43,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:58:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395424934] [2023-11-30 02:58:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:58:43,473 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:58:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:58:43,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:58:43,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:58:43,474 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 168 [2023-11-30 02:58:43,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 126 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:58:43,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 168 [2023-11-30 02:58:43,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:58:43,506 INFO L124 PetriNetUnfolderBase]: 35/186 cut-off events. [2023-11-30 02:58:43,506 INFO L125 PetriNetUnfolderBase]: For 1518/1518 co-relation queries the response was YES. [2023-11-30 02:58:43,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 186 events. 35/186 cut-off events. For 1518/1518 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 288 event pairs, 7 based on Foata normal form. 1/183 useless extension candidates. Maximal degree in co-relation 451. Up to 64 conditions per place. [2023-11-30 02:58:43,507 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 0 selfloop transitions, 0 changer transitions 124/124 dead transitions. [2023-11-30 02:58:43,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 124 transitions, 772 flow [2023-11-30 02:58:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:58:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:58:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-11-30 02:58:43,508 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8293650793650794 [2023-11-30 02:58:43,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-11-30 02:58:43,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-11-30 02:58:43,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:58:43,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-11-30 02:58:43,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,511 INFO L307 CegarLoopForPetriNet]: 146 programPoint places, -2 predicate places. [2023-11-30 02:58:43,511 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 124 transitions, 772 flow [2023-11-30 02:58:43,511 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:58:43,516 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/chl-time-symm.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 02:58:43,533 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2023-11-30 02:58:43,534 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2023-11-30 02:58:43,534 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2023-11-30 02:58:43,534 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2023-11-30 02:58:43,534 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2023-11-30 02:58:43,534 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2023-11-30 02:58:43,534 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2023-11-30 02:58:43,534 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2023-11-30 02:58:43,535 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2023-11-30 02:58:43,535 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2023-11-30 02:58:43,535 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2023-11-30 02:58:43,535 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2023-11-30 02:58:43,535 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2023-11-30 02:58:43,535 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2023-11-30 02:58:43,535 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2023-11-30 02:58:43,535 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2023-11-30 02:58:43,535 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2023-11-30 02:58:43,535 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2023-11-30 02:58:43,535 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2023-11-30 02:58:43,536 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2023-11-30 02:58:43,536 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2023-11-30 02:58:43,536 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2023-11-30 02:58:43,536 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2023-11-30 02:58:43,536 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2023-11-30 02:58:43,536 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2023-11-30 02:58:43,536 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2023-11-30 02:58:43,536 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2023-11-30 02:58:43,536 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2023-11-30 02:58:43,536 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 46 remaining) [2023-11-30 02:58:43,536 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 46 remaining) [2023-11-30 02:58:43,537 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2023-11-30 02:58:43,537 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2023-11-30 02:58:43,537 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2023-11-30 02:58:43,537 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2023-11-30 02:58:43,537 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2023-11-30 02:58:43,537 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2023-11-30 02:58:43,537 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2023-11-30 02:58:43,537 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2023-11-30 02:58:43,537 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2023-11-30 02:58:43,537 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2023-11-30 02:58:43,537 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2023-11-30 02:58:43,538 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2023-11-30 02:58:43,538 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2023-11-30 02:58:43,538 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2023-11-30 02:58:43,538 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2023-11-30 02:58:43,538 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2023-11-30 02:58:43,538 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 02:58:43,538 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 02:58:43,542 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 02:58:43,542 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 02:58:43,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:58:43 BasicIcfg [2023-11-30 02:58:43,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 02:58:43,547 INFO L158 Benchmark]: Toolchain (without parser) took 3130.29ms. Allocated memory was 310.4MB in the beginning and 385.9MB in the end (delta: 75.5MB). Free memory was 272.2MB in the beginning and 206.1MB in the end (delta: 66.1MB). Peak memory consumption was 143.2MB. Max. memory is 16.0GB. [2023-11-30 02:58:43,547 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 310.4MB. Free memory is still 266.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 02:58:43,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.93ms. Allocated memory is still 310.4MB. Free memory was 272.2MB in the beginning and 260.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 02:58:43,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.22ms. Allocated memory is still 310.4MB. Free memory was 260.4MB in the beginning and 258.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 02:58:43,547 INFO L158 Benchmark]: Boogie Preprocessor took 21.32ms. Allocated memory is still 310.4MB. Free memory was 257.7MB in the beginning and 256.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 02:58:43,547 INFO L158 Benchmark]: RCFGBuilder took 745.94ms. Allocated memory was 310.4MB in the beginning and 385.9MB in the end (delta: 75.5MB). Free memory was 256.0MB in the beginning and 333.2MB in the end (delta: -77.2MB). Peak memory consumption was 54.9MB. Max. memory is 16.0GB. [2023-11-30 02:58:43,548 INFO L158 Benchmark]: TraceAbstraction took 2120.16ms. Allocated memory is still 385.9MB. Free memory was 333.2MB in the beginning and 206.1MB in the end (delta: 127.1MB). Peak memory consumption was 126.0MB. Max. memory is 16.0GB. [2023-11-30 02:58:43,548 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.10ms. Allocated memory is still 310.4MB. Free memory is still 266.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 201.93ms. Allocated memory is still 310.4MB. Free memory was 272.2MB in the beginning and 260.4MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.22ms. Allocated memory is still 310.4MB. Free memory was 260.4MB in the beginning and 258.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.32ms. Allocated memory is still 310.4MB. Free memory was 257.7MB in the beginning and 256.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 745.94ms. Allocated memory was 310.4MB in the beginning and 385.9MB in the end (delta: 75.5MB). Free memory was 256.0MB in the beginning and 333.2MB in the end (delta: -77.2MB). Peak memory consumption was 54.9MB. Max. memory is 16.0GB. * TraceAbstraction took 2120.16ms. Allocated memory is still 385.9MB. Free memory was 333.2MB in the beginning and 206.1MB in the end (delta: 127.1MB). Peak memory consumption was 126.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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: 79]: 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: 79]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 194 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 58 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=772occurred in iteration=10, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 626 ConstructedInterpolants, 0 QuantifiedInterpolants, 804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 28 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 02:58:43,573 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...