./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b78611c293a7a651605e3dc9bdfe409b46ee0a572a0a5030b4011d70f271b607 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 13:59:55,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 13:59:55,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 13:59:55,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 13:59:55,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 13:59:55,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 13:59:55,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 13:59:55,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 13:59:55,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 13:59:55,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 13:59:55,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 13:59:55,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 13:59:55,347 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 13:59:55,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 13:59:55,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 13:59:55,350 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 13:59:55,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 13:59:55,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 13:59:55,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 13:59:55,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 13:59:55,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 13:59:55,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 13:59:55,358 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 13:59:55,359 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 13:59:55,359 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 13:59:55,359 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 13:59:55,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 13:59:55,359 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 13:59:55,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 13:59:55,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 13:59:55,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 13:59:55,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:59:55,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 13:59:55,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 13:59:55,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 13:59:55,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 13:59:55,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 13:59:55,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 13:59:55,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 13:59:55,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 13:59:55,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 13:59:55,368 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b78611c293a7a651605e3dc9bdfe409b46ee0a572a0a5030b4011d70f271b607 [2024-11-20 13:59:55,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 13:59:55,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 13:59:55,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 13:59:55,622 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 13:59:55,622 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 13:59:55,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race.i [2024-11-20 13:59:57,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 13:59:57,562 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 13:59:57,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race.i [2024-11-20 13:59:57,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53500ace5/45bb99bd68f147b1952a51c37156c8fa/FLAG334782070 [2024-11-20 13:59:57,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53500ace5/45bb99bd68f147b1952a51c37156c8fa [2024-11-20 13:59:57,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 13:59:57,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 13:59:57,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 13:59:57,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 13:59:57,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 13:59:57,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:59:57" (1/1) ... [2024-11-20 13:59:57,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@393e8cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:57, skipping insertion in model container [2024-11-20 13:59:57,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:59:57" (1/1) ... [2024-11-20 13:59:57,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 13:59:58,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:59:58,157 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 13:59:58,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:59:58,233 INFO L204 MainTranslator]: Completed translation [2024-11-20 13:59:58,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58 WrapperNode [2024-11-20 13:59:58,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 13:59:58,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 13:59:58,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 13:59:58,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 13:59:58,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (1/1) ... [2024-11-20 13:59:58,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (1/1) ... [2024-11-20 13:59:58,281 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2024-11-20 13:59:58,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 13:59:58,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 13:59:58,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 13:59:58,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 13:59:58,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (1/1) ... [2024-11-20 13:59:58,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (1/1) ... [2024-11-20 13:59:58,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (1/1) ... [2024-11-20 13:59:58,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (1/1) ... [2024-11-20 13:59:58,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (1/1) ... [2024-11-20 13:59:58,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (1/1) ... [2024-11-20 13:59:58,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (1/1) ... [2024-11-20 13:59:58,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (1/1) ... [2024-11-20 13:59:58,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 13:59:58,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 13:59:58,326 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 13:59:58,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 13:59:58,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (1/1) ... [2024-11-20 13:59:58,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:59:58,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:59:58,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 13:59:58,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 13:59:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 13:59:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 13:59:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-20 13:59:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 13:59:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 13:59:58,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 13:59:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 13:59:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-20 13:59:58,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-20 13:59:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-20 13:59:58,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 13:59:58,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 13:59:58,406 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 13:59:58,492 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 13:59:58,494 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 13:59:58,635 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 13:59:58,635 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 13:59:58,649 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 13:59:58,649 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 13:59:58,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:59:58 BoogieIcfgContainer [2024-11-20 13:59:58,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 13:59:58,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 13:59:58,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 13:59:58,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 13:59:58,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:59:57" (1/3) ... [2024-11-20 13:59:58,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fc628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:59:58, skipping insertion in model container [2024-11-20 13:59:58,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:59:58" (2/3) ... [2024-11-20 13:59:58,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fc628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:59:58, skipping insertion in model container [2024-11-20 13:59:58,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:59:58" (3/3) ... [2024-11-20 13:59:58,657 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race.i [2024-11-20 13:59:58,669 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 13:59:58,669 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-20 13:59:58,669 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 13:59:58,705 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-20 13:59:58,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 79 transitions, 165 flow [2024-11-20 13:59:58,764 INFO L124 PetriNetUnfolderBase]: 5/114 cut-off events. [2024-11-20 13:59:58,764 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 13:59:58,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 114 events. 5/114 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 216 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2024-11-20 13:59:58,768 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 79 transitions, 165 flow [2024-11-20 13:59:58,771 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 79 transitions, 165 flow [2024-11-20 13:59:58,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:59:58,783 INFO L333 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, 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;@229e0baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:59:58,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-20 13:59:58,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:59:58,790 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-20 13:59:58,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:59:58,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:59:58,791 INFO L204 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] [2024-11-20 13:59:58,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 13:59:58,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:59:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1339485524, now seen corresponding path program 1 times [2024-11-20 13:59:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:59:58,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733291371] [2024-11-20 13:59:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:59:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:59:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:59:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:59:59,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:59:59,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733291371] [2024-11-20 13:59:59,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733291371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:59:59,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:59:59,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 13:59:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313706478] [2024-11-20 13:59:59,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:59:59,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 13:59:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:59:59,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 13:59:59,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 13:59:59,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 79 [2024-11-20 13:59:59,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:59:59,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:59:59,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 79 [2024-11-20 13:59:59,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:59:59,246 INFO L124 PetriNetUnfolderBase]: 8/187 cut-off events. [2024-11-20 13:59:59,246 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-20 13:59:59,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 187 events. 8/187 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 576 event pairs, 0 based on Foata normal form. 5/172 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2024-11-20 13:59:59,249 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 10 selfloop transitions, 4 changer transitions 1/81 dead transitions. [2024-11-20 13:59:59,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 199 flow [2024-11-20 13:59:59,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 13:59:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 13:59:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2024-11-20 13:59:59,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8955696202531646 [2024-11-20 13:59:59,260 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 165 flow. Second operand 4 states and 283 transitions. [2024-11-20 13:59:59,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 199 flow [2024-11-20 13:59:59,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 199 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:59:59,264 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 173 flow [2024-11-20 13:59:59,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2024-11-20 13:59:59,268 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2024-11-20 13:59:59,268 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 173 flow [2024-11-20 13:59:59,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:59:59,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:59:59,269 INFO L204 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] [2024-11-20 13:59:59,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 13:59:59,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 13:59:59,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:59:59,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1244862311, now seen corresponding path program 1 times [2024-11-20 13:59:59,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:59:59,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261197385] [2024-11-20 13:59:59,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:59:59,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:59:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:59:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:59:59,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:59:59,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261197385] [2024-11-20 13:59:59,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261197385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:59:59,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:59:59,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:59:59,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090128965] [2024-11-20 13:59:59,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:59:59,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:59:59,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:59:59,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:59:59,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:59:59,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 79 [2024-11-20 13:59:59,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:59:59,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:59:59,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 79 [2024-11-20 13:59:59,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:59:59,843 INFO L124 PetriNetUnfolderBase]: 30/231 cut-off events. [2024-11-20 13:59:59,845 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-20 13:59:59,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 231 events. 30/231 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 926 event pairs, 11 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 268. Up to 62 conditions per place. [2024-11-20 13:59:59,846 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 25 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2024-11-20 13:59:59,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 247 flow [2024-11-20 13:59:59,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:59:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:59:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 355 transitions. [2024-11-20 13:59:59,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7489451476793249 [2024-11-20 13:59:59,851 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 173 flow. Second operand 6 states and 355 transitions. [2024-11-20 13:59:59,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 247 flow [2024-11-20 13:59:59,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 84 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 13:59:59,855 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 173 flow [2024-11-20 13:59:59,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2024-11-20 13:59:59,857 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2024-11-20 13:59:59,857 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 173 flow [2024-11-20 13:59:59,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:59:59,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:59:59,857 INFO L204 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] [2024-11-20 13:59:59,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 13:59:59,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 13:59:59,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:59:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -469446995, now seen corresponding path program 1 times [2024-11-20 13:59:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:59:59,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449881120] [2024-11-20 13:59:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:59:59,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:59:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:59:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:59:59,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:59:59,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449881120] [2024-11-20 13:59:59,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449881120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:59:59,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:59:59,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:59:59,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122029339] [2024-11-20 13:59:59,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:59:59,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:59:59,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:59:59,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:59:59,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:59:59,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 79 [2024-11-20 13:59:59,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:59:59,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:59:59,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 79 [2024-11-20 13:59:59,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:59:59,938 INFO L124 PetriNetUnfolderBase]: 6/143 cut-off events. [2024-11-20 13:59:59,940 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2024-11-20 13:59:59,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 143 events. 6/143 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 379 event pairs, 4 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 136. Up to 21 conditions per place. [2024-11-20 13:59:59,941 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 9 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2024-11-20 13:59:59,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 79 transitions, 205 flow [2024-11-20 13:59:59,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:59:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:59:59,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2024-11-20 13:59:59,943 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9071729957805907 [2024-11-20 13:59:59,943 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 173 flow. Second operand 3 states and 215 transitions. [2024-11-20 13:59:59,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 79 transitions, 205 flow [2024-11-20 13:59:59,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 195 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 13:59:59,945 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 193 flow [2024-11-20 13:59:59,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2024-11-20 13:59:59,947 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2024-11-20 13:59:59,947 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 193 flow [2024-11-20 13:59:59,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 13:59:59,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:59:59,948 INFO L204 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] [2024-11-20 13:59:59,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 13:59:59,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 13:59:59,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:59:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash 441889680, now seen corresponding path program 1 times [2024-11-20 13:59:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:59:59,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110909893] [2024-11-20 13:59:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:59:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:59:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:00:00,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:00,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110909893] [2024-11-20 14:00:00,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110909893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:00,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:00,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:00:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383788041] [2024-11-20 14:00:00,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:00,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:00:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:00,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:00:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:00:00,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 79 [2024-11-20 14:00:00,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:00,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:00,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 79 [2024-11-20 14:00:00,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:00,089 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2024-11-20 14:00:00,090 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-20 14:00:00,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 108 events. 2/108 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 154 event pairs, 0 based on Foata normal form. 3/106 useless extension candidates. Maximal degree in co-relation 83. Up to 7 conditions per place. [2024-11-20 14:00:00,092 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 9 selfloop transitions, 3 changer transitions 7/77 dead transitions. [2024-11-20 14:00:00,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 203 flow [2024-11-20 14:00:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:00:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 14:00:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2024-11-20 14:00:00,094 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.879746835443038 [2024-11-20 14:00:00,094 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 193 flow. Second operand 4 states and 278 transitions. [2024-11-20 14:00:00,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 203 flow [2024-11-20 14:00:00,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 77 transitions, 191 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-20 14:00:00,096 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 157 flow [2024-11-20 14:00:00,097 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2024-11-20 14:00:00,097 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2024-11-20 14:00:00,098 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 157 flow [2024-11-20 14:00:00,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:00,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:00,099 INFO L204 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] [2024-11-20 14:00:00,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:00:00,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 14:00:00,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:00,101 INFO L85 PathProgramCache]: Analyzing trace with hash 215499896, now seen corresponding path program 1 times [2024-11-20 14:00:00,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:00,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203880526] [2024-11-20 14:00:00,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:00,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:00,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:00,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203880526] [2024-11-20 14:00:00,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203880526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:00:00,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799592204] [2024-11-20 14:00:00,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:00,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:00,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:00,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:00:00,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 14:00:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:00,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:00:00,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:00:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:00,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:00:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:00,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799592204] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:00:00,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:00:00,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-20 14:00:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914411147] [2024-11-20 14:00:00,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:00:00,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:00:00,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:00:00,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:00:00,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 79 [2024-11-20 14:00:00,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 157 flow. Second operand has 13 states, 13 states have (on average 64.92307692307692) internal successors, (844), 13 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:00,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:00,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 79 [2024-11-20 14:00:00,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:00,702 INFO L124 PetriNetUnfolderBase]: 8/97 cut-off events. [2024-11-20 14:00:00,702 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 14:00:00,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 97 events. 8/97 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 160 event pairs, 0 based on Foata normal form. 3/98 useless extension candidates. Maximal degree in co-relation 130. Up to 10 conditions per place. [2024-11-20 14:00:00,703 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 12 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-11-20 14:00:00,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 152 flow [2024-11-20 14:00:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:00:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-20 14:00:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 459 transitions. [2024-11-20 14:00:00,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8300180831826401 [2024-11-20 14:00:00,705 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 157 flow. Second operand 7 states and 459 transitions. [2024-11-20 14:00:00,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 152 flow [2024-11-20 14:00:00,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 55 transitions, 149 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:00,706 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 111 flow [2024-11-20 14:00:00,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-11-20 14:00:00,706 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2024-11-20 14:00:00,707 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 111 flow [2024-11-20 14:00:00,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.92307692307692) internal successors, (844), 13 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:00,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:00,707 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:00,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 14:00:00,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:00,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-20 14:00:00,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1790622290, now seen corresponding path program 1 times [2024-11-20 14:00:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975312531] [2024-11-20 14:00:00,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:00,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:00,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:00:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:00,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:00:00,972 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:00:00,973 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-20 14:00:00,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-11-20 14:00:00,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-11-20 14:00:00,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-11-20 14:00:00,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-11-20 14:00:00,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-11-20 14:00:00,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:00:00,976 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 14:00:00,982 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 14:00:00,982 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-20 14:00:00,992 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-20 14:00:00,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 97 transitions, 210 flow [2024-11-20 14:00:01,006 INFO L124 PetriNetUnfolderBase]: 10/203 cut-off events. [2024-11-20 14:00:01,007 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-20 14:00:01,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 203 events. 10/203 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 463 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 116. Up to 8 conditions per place. [2024-11-20 14:00:01,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 97 transitions, 210 flow [2024-11-20 14:00:01,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 97 transitions, 210 flow [2024-11-20 14:00:01,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:00:01,010 INFO L333 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, 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;@229e0baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:00:01,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-20 14:00:01,011 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:00:01,011 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-20 14:00:01,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:00:01,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:01,012 INFO L204 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] [2024-11-20 14:00:01,012 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:01,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash -893886452, now seen corresponding path program 1 times [2024-11-20 14:00:01,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:01,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255809642] [2024-11-20 14:00:01,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:01,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:01,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:01,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255809642] [2024-11-20 14:00:01,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255809642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:01,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:01,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:00:01,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534511715] [2024-11-20 14:00:01,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:01,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:00:01,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:00:01,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:00:01,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-20 14:00:01,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:01,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:01,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-20 14:00:01,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:01,144 INFO L124 PetriNetUnfolderBase]: 72/621 cut-off events. [2024-11-20 14:00:01,144 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-20 14:00:01,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 621 events. 72/621 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3742 event pairs, 20 based on Foata normal form. 16/581 useless extension candidates. Maximal degree in co-relation 215. Up to 106 conditions per place. [2024-11-20 14:00:01,151 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 18 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2024-11-20 14:00:01,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 102 transitions, 264 flow [2024-11-20 14:00:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:00:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 14:00:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 346 transitions. [2024-11-20 14:00:01,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8917525773195877 [2024-11-20 14:00:01,153 INFO L175 Difference]: Start difference. First operand has 98 places, 97 transitions, 210 flow. Second operand 4 states and 346 transitions. [2024-11-20 14:00:01,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 102 transitions, 264 flow [2024-11-20 14:00:01,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 14:00:01,155 INFO L231 Difference]: Finished difference. Result has 102 places, 96 transitions, 222 flow [2024-11-20 14:00:01,157 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=102, PETRI_TRANSITIONS=96} [2024-11-20 14:00:01,157 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2024-11-20 14:00:01,157 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 96 transitions, 222 flow [2024-11-20 14:00:01,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:01,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:01,159 INFO L204 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] [2024-11-20 14:00:01,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:00:01,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:01,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:01,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2146723974, now seen corresponding path program 1 times [2024-11-20 14:00:01,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:01,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570144389] [2024-11-20 14:00:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:01,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:01,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:01,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570144389] [2024-11-20 14:00:01,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570144389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:01,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:01,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:01,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601878717] [2024-11-20 14:00:01,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:01,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:01,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:01,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:01,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:01,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2024-11-20 14:00:01,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 96 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:01,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:01,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2024-11-20 14:00:01,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:01,586 INFO L124 PetriNetUnfolderBase]: 236/966 cut-off events. [2024-11-20 14:00:01,586 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-20 14:00:01,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 966 events. 236/966 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6773 event pairs, 34 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 457. Up to 313 conditions per place. [2024-11-20 14:00:01,592 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 38 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2024-11-20 14:00:01,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 111 transitions, 338 flow [2024-11-20 14:00:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 451 transitions. [2024-11-20 14:00:01,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7749140893470791 [2024-11-20 14:00:01,594 INFO L175 Difference]: Start difference. First operand has 102 places, 96 transitions, 222 flow. Second operand 6 states and 451 transitions. [2024-11-20 14:00:01,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 111 transitions, 338 flow [2024-11-20 14:00:01,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 111 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:01,597 INFO L231 Difference]: Finished difference. Result has 104 places, 95 transitions, 224 flow [2024-11-20 14:00:01,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2024-11-20 14:00:01,598 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2024-11-20 14:00:01,601 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 224 flow [2024-11-20 14:00:01,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:01,602 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:01,602 INFO L204 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] [2024-11-20 14:00:01,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:00:01,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:01,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:01,603 INFO L85 PathProgramCache]: Analyzing trace with hash -600500514, now seen corresponding path program 1 times [2024-11-20 14:00:01,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:01,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596177587] [2024-11-20 14:00:01,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:01,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:01,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:01,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596177587] [2024-11-20 14:00:01,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596177587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:01,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:01,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:01,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748824389] [2024-11-20 14:00:01,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:01,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:01,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:01,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:01,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-20 14:00:01,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:01,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:01,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-20 14:00:01,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:01,708 INFO L124 PetriNetUnfolderBase]: 113/682 cut-off events. [2024-11-20 14:00:01,708 INFO L125 PetriNetUnfolderBase]: For 97/142 co-relation queries the response was YES. [2024-11-20 14:00:01,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 682 events. 113/682 cut-off events. For 97/142 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4351 event pairs, 73 based on Foata normal form. 3/606 useless extension candidates. Maximal degree in co-relation 734. Up to 182 conditions per place. [2024-11-20 14:00:01,711 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 18 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2024-11-20 14:00:01,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 103 transitions, 294 flow [2024-11-20 14:00:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2024-11-20 14:00:01,712 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9072164948453608 [2024-11-20 14:00:01,712 INFO L175 Difference]: Start difference. First operand has 104 places, 95 transitions, 224 flow. Second operand 3 states and 264 transitions. [2024-11-20 14:00:01,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 103 transitions, 294 flow [2024-11-20 14:00:01,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 103 transitions, 284 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 14:00:01,714 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 252 flow [2024-11-20 14:00:01,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2024-11-20 14:00:01,715 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2024-11-20 14:00:01,715 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 252 flow [2024-11-20 14:00:01,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:01,716 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:01,716 INFO L204 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] [2024-11-20 14:00:01,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:00:01,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:01,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1946356609, now seen corresponding path program 1 times [2024-11-20 14:00:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:01,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899644496] [2024-11-20 14:00:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:01,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:00:01,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:01,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899644496] [2024-11-20 14:00:01,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899644496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:01,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:01,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:00:01,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400512200] [2024-11-20 14:00:01,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:01,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:00:01,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:01,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:00:01,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:00:01,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-20 14:00:01,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:01,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:01,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-20 14:00:01,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:01,858 INFO L124 PetriNetUnfolderBase]: 57/561 cut-off events. [2024-11-20 14:00:01,859 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-20 14:00:01,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 561 events. 57/561 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3000 event pairs, 20 based on Foata normal form. 15/532 useless extension candidates. Maximal degree in co-relation 618. Up to 66 conditions per place. [2024-11-20 14:00:01,861 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 20 selfloop transitions, 4 changer transitions 2/110 dead transitions. [2024-11-20 14:00:01,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 110 transitions, 332 flow [2024-11-20 14:00:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:00:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 14:00:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2024-11-20 14:00:01,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8943298969072165 [2024-11-20 14:00:01,862 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 252 flow. Second operand 4 states and 347 transitions. [2024-11-20 14:00:01,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 110 transitions, 332 flow [2024-11-20 14:00:01,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 110 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:01,865 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 258 flow [2024-11-20 14:00:01,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2024-11-20 14:00:01,866 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2024-11-20 14:00:01,866 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 258 flow [2024-11-20 14:00:01,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:01,867 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:01,867 INFO L204 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] [2024-11-20 14:00:01,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:00:01,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:01,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:01,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1806144296, now seen corresponding path program 1 times [2024-11-20 14:00:01,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:01,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782694384] [2024-11-20 14:00:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:01,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:01,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782694384] [2024-11-20 14:00:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782694384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:00:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963767464] [2024-11-20 14:00:01,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:01,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:01,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:01,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:00:01,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 14:00:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:02,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:00:02,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:00:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:02,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:00:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:02,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963767464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:00:02,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:00:02,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-20 14:00:02,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128845915] [2024-11-20 14:00:02,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:00:02,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:00:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:02,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:00:02,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:00:02,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2024-11-20 14:00:02,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 258 flow. Second operand has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:02,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:02,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2024-11-20 14:00:02,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:02,402 INFO L124 PetriNetUnfolderBase]: 81/451 cut-off events. [2024-11-20 14:00:02,403 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-20 14:00:02,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 451 events. 81/451 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2359 event pairs, 6 based on Foata normal form. 15/444 useless extension candidates. Maximal degree in co-relation 650. Up to 56 conditions per place. [2024-11-20 14:00:02,404 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 28 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-11-20 14:00:02,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 92 transitions, 290 flow [2024-11-20 14:00:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:00:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 14:00:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 808 transitions. [2024-11-20 14:00:02,408 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8329896907216495 [2024-11-20 14:00:02,408 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 258 flow. Second operand 10 states and 808 transitions. [2024-11-20 14:00:02,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 92 transitions, 290 flow [2024-11-20 14:00:02,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 92 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 14:00:02,411 INFO L231 Difference]: Finished difference. Result has 86 places, 72 transitions, 193 flow [2024-11-20 14:00:02,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=193, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2024-11-20 14:00:02,412 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -12 predicate places. [2024-11-20 14:00:02,413 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 193 flow [2024-11-20 14:00:02,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:02,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:02,414 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:02,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 14:00:02,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-20 14:00:02,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:02,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1670194504, now seen corresponding path program 1 times [2024-11-20 14:00:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:02,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954933871] [2024-11-20 14:00:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:02,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-20 14:00:02,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:02,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954933871] [2024-11-20 14:00:02,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954933871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:02,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:02,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:02,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583442950] [2024-11-20 14:00:02,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:02,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:02,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:02,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:02,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-20 14:00:02,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:02,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:02,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-20 14:00:02,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:02,694 INFO L124 PetriNetUnfolderBase]: 27/229 cut-off events. [2024-11-20 14:00:02,695 INFO L125 PetriNetUnfolderBase]: For 27/31 co-relation queries the response was YES. [2024-11-20 14:00:02,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 229 events. 27/229 cut-off events. For 27/31 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 816 event pairs, 16 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 360. Up to 55 conditions per place. [2024-11-20 14:00:02,696 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 13 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2024-11-20 14:00:02,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 241 flow [2024-11-20 14:00:02,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2024-11-20 14:00:02,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865979381443299 [2024-11-20 14:00:02,698 INFO L175 Difference]: Start difference. First operand has 86 places, 72 transitions, 193 flow. Second operand 3 states and 258 transitions. [2024-11-20 14:00:02,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 241 flow [2024-11-20 14:00:02,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 224 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-11-20 14:00:02,699 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 212 flow [2024-11-20 14:00:02,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2024-11-20 14:00:02,700 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -14 predicate places. [2024-11-20 14:00:02,700 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 212 flow [2024-11-20 14:00:02,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:02,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:02,701 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:02,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 14:00:02,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-20 14:00:02,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1646502877, now seen corresponding path program 1 times [2024-11-20 14:00:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:02,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680298978] [2024-11-20 14:00:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:02,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:00:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:02,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:00:02,743 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:00:02,743 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-20 14:00:02,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-20 14:00:02,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-20 14:00:02,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-20 14:00:02,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-20 14:00:02,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-20 14:00:02,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-20 14:00:02,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:00:02,745 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:02,745 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 14:00:02,745 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-20 14:00:02,762 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-20 14:00:02,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 115 transitions, 257 flow [2024-11-20 14:00:02,782 INFO L124 PetriNetUnfolderBase]: 20/345 cut-off events. [2024-11-20 14:00:02,783 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-20 14:00:02,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 345 events. 20/345 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 968 event pairs, 1 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 211. Up to 16 conditions per place. [2024-11-20 14:00:02,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 115 transitions, 257 flow [2024-11-20 14:00:02,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 115 transitions, 257 flow [2024-11-20 14:00:02,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:00:02,787 INFO L333 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, 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;@229e0baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:00:02,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-20 14:00:02,789 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:00:02,789 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-20 14:00:02,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:00:02,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:02,790 INFO L204 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] [2024-11-20 14:00:02,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:02,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:02,790 INFO L85 PathProgramCache]: Analyzing trace with hash 298571308, now seen corresponding path program 1 times [2024-11-20 14:00:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:02,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490426887] [2024-11-20 14:00:02,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:02,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:02,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:02,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490426887] [2024-11-20 14:00:02,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490426887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:02,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:02,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:00:02,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348495523] [2024-11-20 14:00:02,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:02,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:00:02,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:00:02,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:00:02,844 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2024-11-20 14:00:02,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 115 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:02,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:02,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2024-11-20 14:00:02,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:03,021 INFO L124 PetriNetUnfolderBase]: 413/2217 cut-off events. [2024-11-20 14:00:03,022 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2024-11-20 14:00:03,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 2217 events. 413/2217 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 17749 event pairs, 232 based on Foata normal form. 64/2094 useless extension candidates. Maximal degree in co-relation 1335. Up to 496 conditions per place. [2024-11-20 14:00:03,033 INFO L140 encePairwiseOnDemand]: 108/115 looper letters, 24 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2024-11-20 14:00:03,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 327 flow [2024-11-20 14:00:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:00:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 14:00:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2024-11-20 14:00:03,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8869565217391304 [2024-11-20 14:00:03,034 INFO L175 Difference]: Start difference. First operand has 117 places, 115 transitions, 257 flow. Second operand 4 states and 408 transitions. [2024-11-20 14:00:03,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 327 flow [2024-11-20 14:00:03,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 122 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 14:00:03,036 INFO L231 Difference]: Finished difference. Result has 121 places, 114 transitions, 269 flow [2024-11-20 14:00:03,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=121, PETRI_TRANSITIONS=114} [2024-11-20 14:00:03,037 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 4 predicate places. [2024-11-20 14:00:03,037 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 114 transitions, 269 flow [2024-11-20 14:00:03,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:03,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:03,037 INFO L204 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] [2024-11-20 14:00:03,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:00:03,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:03,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:03,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1311986835, now seen corresponding path program 1 times [2024-11-20 14:00:03,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:03,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581890733] [2024-11-20 14:00:03,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:03,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:03,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:03,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581890733] [2024-11-20 14:00:03,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581890733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:03,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:03,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101010155] [2024-11-20 14:00:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:03,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:03,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:03,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2024-11-20 14:00:03,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 114 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:03,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:03,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2024-11-20 14:00:03,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:03,623 INFO L124 PetriNetUnfolderBase]: 1295/3966 cut-off events. [2024-11-20 14:00:03,624 INFO L125 PetriNetUnfolderBase]: For 323/323 co-relation queries the response was YES. [2024-11-20 14:00:03,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6318 conditions, 3966 events. 1295/3966 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 34968 event pairs, 181 based on Foata normal form. 0/3693 useless extension candidates. Maximal degree in co-relation 2095. Up to 1483 conditions per place. [2024-11-20 14:00:03,643 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 50 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2024-11-20 14:00:03,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 137 transitions, 425 flow [2024-11-20 14:00:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2024-11-20 14:00:03,645 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7927536231884058 [2024-11-20 14:00:03,645 INFO L175 Difference]: Start difference. First operand has 121 places, 114 transitions, 269 flow. Second operand 6 states and 547 transitions. [2024-11-20 14:00:03,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 137 transitions, 425 flow [2024-11-20 14:00:03,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 137 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:03,648 INFO L231 Difference]: Finished difference. Result has 123 places, 113 transitions, 271 flow [2024-11-20 14:00:03,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=123, PETRI_TRANSITIONS=113} [2024-11-20 14:00:03,649 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2024-11-20 14:00:03,649 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 113 transitions, 271 flow [2024-11-20 14:00:03,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:03,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:03,649 INFO L204 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] [2024-11-20 14:00:03,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 14:00:03,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:03,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash 229011713, now seen corresponding path program 1 times [2024-11-20 14:00:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:03,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321856490] [2024-11-20 14:00:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:03,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:03,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:03,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321856490] [2024-11-20 14:00:03,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321856490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:03,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:03,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:03,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211107379] [2024-11-20 14:00:03,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:03,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:03,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:03,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:03,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:03,687 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2024-11-20 14:00:03,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 113 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:03,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:03,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2024-11-20 14:00:03,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:04,084 INFO L124 PetriNetUnfolderBase]: 1006/3964 cut-off events. [2024-11-20 14:00:04,085 INFO L125 PetriNetUnfolderBase]: For 689/877 co-relation queries the response was YES. [2024-11-20 14:00:04,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5877 conditions, 3964 events. 1006/3964 cut-off events. For 689/877 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 37447 event pairs, 683 based on Foata normal form. 6/3504 useless extension candidates. Maximal degree in co-relation 4693. Up to 1312 conditions per place. [2024-11-20 14:00:04,104 INFO L140 encePairwiseOnDemand]: 108/115 looper letters, 27 selfloop transitions, 6 changer transitions 0/126 dead transitions. [2024-11-20 14:00:04,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 126 transitions, 381 flow [2024-11-20 14:00:04,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2024-11-20 14:00:04,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9072463768115943 [2024-11-20 14:00:04,106 INFO L175 Difference]: Start difference. First operand has 123 places, 113 transitions, 271 flow. Second operand 3 states and 313 transitions. [2024-11-20 14:00:04,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 126 transitions, 381 flow [2024-11-20 14:00:04,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 126 transitions, 371 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 14:00:04,107 INFO L231 Difference]: Finished difference. Result has 122 places, 118 transitions, 307 flow [2024-11-20 14:00:04,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=122, PETRI_TRANSITIONS=118} [2024-11-20 14:00:04,108 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2024-11-20 14:00:04,108 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 118 transitions, 307 flow [2024-11-20 14:00:04,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:04,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:04,109 INFO L204 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] [2024-11-20 14:00:04,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 14:00:04,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:04,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash 891797700, now seen corresponding path program 1 times [2024-11-20 14:00:04,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:04,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291726822] [2024-11-20 14:00:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:00:04,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:04,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291726822] [2024-11-20 14:00:04,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291726822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:04,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:04,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:00:04,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869942749] [2024-11-20 14:00:04,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:04,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:00:04,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:04,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:00:04,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:00:04,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2024-11-20 14:00:04,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 118 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:04,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:04,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2024-11-20 14:00:04,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:04,545 INFO L124 PetriNetUnfolderBase]: 616/3187 cut-off events. [2024-11-20 14:00:04,545 INFO L125 PetriNetUnfolderBase]: For 440/444 co-relation queries the response was YES. [2024-11-20 14:00:04,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 3187 events. 616/3187 cut-off events. For 440/444 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 29208 event pairs, 252 based on Foata normal form. 63/2922 useless extension candidates. Maximal degree in co-relation 3838. Up to 511 conditions per place. [2024-11-20 14:00:04,558 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 31 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2024-11-20 14:00:04,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 134 transitions, 418 flow [2024-11-20 14:00:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:00:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 14:00:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2024-11-20 14:00:04,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2024-11-20 14:00:04,560 INFO L175 Difference]: Start difference. First operand has 122 places, 118 transitions, 307 flow. Second operand 4 states and 412 transitions. [2024-11-20 14:00:04,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 134 transitions, 418 flow [2024-11-20 14:00:04,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 134 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:04,562 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 311 flow [2024-11-20 14:00:04,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2024-11-20 14:00:04,563 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 7 predicate places. [2024-11-20 14:00:04,563 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 311 flow [2024-11-20 14:00:04,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:04,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:04,563 INFO L204 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] [2024-11-20 14:00:04,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 14:00:04,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:04,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1167396584, now seen corresponding path program 1 times [2024-11-20 14:00:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:04,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511663981] [2024-11-20 14:00:04,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:04,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:04,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:04,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511663981] [2024-11-20 14:00:04,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511663981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:00:04,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392804141] [2024-11-20 14:00:04,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:04,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:04,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:04,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:00:04,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 14:00:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:04,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:00:04,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:00:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:04,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:00:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:04,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392804141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:00:04,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:00:04,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-20 14:00:04,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691000932] [2024-11-20 14:00:04,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:00:04,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:00:04,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:04,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:00:04,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:00:04,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2024-11-20 14:00:04,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 311 flow. Second operand has 13 states, 13 states have (on average 92.92307692307692) internal successors, (1208), 13 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:04,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:04,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2024-11-20 14:00:04,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:05,324 INFO L124 PetriNetUnfolderBase]: 1016/4727 cut-off events. [2024-11-20 14:00:05,324 INFO L125 PetriNetUnfolderBase]: For 589/589 co-relation queries the response was YES. [2024-11-20 14:00:05,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6998 conditions, 4727 events. 1016/4727 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 45383 event pairs, 151 based on Foata normal form. 15/4186 useless extension candidates. Maximal degree in co-relation 3820. Up to 749 conditions per place. [2024-11-20 14:00:05,349 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 50 selfloop transitions, 11 changer transitions 0/157 dead transitions. [2024-11-20 14:00:05,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 157 transitions, 511 flow [2024-11-20 14:00:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:00:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 14:00:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions. [2024-11-20 14:00:05,351 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8460869565217392 [2024-11-20 14:00:05,352 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 311 flow. Second operand 10 states and 973 transitions. [2024-11-20 14:00:05,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 157 transitions, 511 flow [2024-11-20 14:00:05,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 157 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:05,355 INFO L231 Difference]: Finished difference. Result has 134 places, 125 transitions, 361 flow [2024-11-20 14:00:05,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=361, PETRI_PLACES=134, PETRI_TRANSITIONS=125} [2024-11-20 14:00:05,356 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2024-11-20 14:00:05,356 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 125 transitions, 361 flow [2024-11-20 14:00:05,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 92.92307692307692) internal successors, (1208), 13 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:05,357 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:05,357 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:05,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 14:00:05,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 14:00:05,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:05,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:05,562 INFO L85 PathProgramCache]: Analyzing trace with hash 326891128, now seen corresponding path program 1 times [2024-11-20 14:00:05,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:05,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758404184] [2024-11-20 14:00:05,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:05,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-20 14:00:05,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:05,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758404184] [2024-11-20 14:00:05,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758404184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:05,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:05,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:05,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658267010] [2024-11-20 14:00:05,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:05,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:05,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:05,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:05,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2024-11-20 14:00:05,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 125 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:05,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:05,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2024-11-20 14:00:05,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:06,111 INFO L124 PetriNetUnfolderBase]: 902/4358 cut-off events. [2024-11-20 14:00:06,111 INFO L125 PetriNetUnfolderBase]: For 1389/1779 co-relation queries the response was YES. [2024-11-20 14:00:06,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7151 conditions, 4358 events. 902/4358 cut-off events. For 1389/1779 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 42585 event pairs, 487 based on Foata normal form. 16/3918 useless extension candidates. Maximal degree in co-relation 2739. Up to 1159 conditions per place. [2024-11-20 14:00:06,146 INFO L140 encePairwiseOnDemand]: 108/115 looper letters, 28 selfloop transitions, 9 changer transitions 0/139 dead transitions. [2024-11-20 14:00:06,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 139 transitions, 486 flow [2024-11-20 14:00:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2024-11-20 14:00:06,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9043478260869565 [2024-11-20 14:00:06,148 INFO L175 Difference]: Start difference. First operand has 134 places, 125 transitions, 361 flow. Second operand 3 states and 312 transitions. [2024-11-20 14:00:06,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 139 transitions, 486 flow [2024-11-20 14:00:06,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 139 transitions, 478 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:06,152 INFO L231 Difference]: Finished difference. Result has 136 places, 132 transitions, 429 flow [2024-11-20 14:00:06,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=136, PETRI_TRANSITIONS=132} [2024-11-20 14:00:06,153 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2024-11-20 14:00:06,153 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 132 transitions, 429 flow [2024-11-20 14:00:06,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:06,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:06,154 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:06,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 14:00:06,154 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:06,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:06,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1507852796, now seen corresponding path program 1 times [2024-11-20 14:00:06,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:06,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771433307] [2024-11-20 14:00:06,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:06,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-20 14:00:06,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:06,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771433307] [2024-11-20 14:00:06,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771433307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:06,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:06,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:00:06,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878512187] [2024-11-20 14:00:06,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:06,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:06,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:06,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2024-11-20 14:00:06,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 132 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:06,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:06,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2024-11-20 14:00:06,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:06,367 INFO L124 PetriNetUnfolderBase]: 91/1246 cut-off events. [2024-11-20 14:00:06,367 INFO L125 PetriNetUnfolderBase]: For 334/370 co-relation queries the response was YES. [2024-11-20 14:00:06,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 1246 events. 91/1246 cut-off events. For 334/370 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9041 event pairs, 48 based on Foata normal form. 20/1178 useless extension candidates. Maximal degree in co-relation 1620. Up to 106 conditions per place. [2024-11-20 14:00:06,372 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 12 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2024-11-20 14:00:06,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 450 flow [2024-11-20 14:00:06,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2024-11-20 14:00:06,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9304347826086956 [2024-11-20 14:00:06,373 INFO L175 Difference]: Start difference. First operand has 136 places, 132 transitions, 429 flow. Second operand 3 states and 321 transitions. [2024-11-20 14:00:06,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 450 flow [2024-11-20 14:00:06,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 131 transitions, 438 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:06,377 INFO L231 Difference]: Finished difference. Result has 136 places, 126 transitions, 383 flow [2024-11-20 14:00:06,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=136, PETRI_TRANSITIONS=126} [2024-11-20 14:00:06,377 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2024-11-20 14:00:06,377 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 126 transitions, 383 flow [2024-11-20 14:00:06,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:06,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:06,378 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:06,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 14:00:06,378 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:06,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:06,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1467994336, now seen corresponding path program 1 times [2024-11-20 14:00:06,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:06,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262361626] [2024-11-20 14:00:06,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:06,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-20 14:00:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262361626] [2024-11-20 14:00:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262361626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:06,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:06,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767561174] [2024-11-20 14:00:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:06,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:06,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:06,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:06,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2024-11-20 14:00:06,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 126 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:06,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:06,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2024-11-20 14:00:06,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:06,547 INFO L124 PetriNetUnfolderBase]: 177/1427 cut-off events. [2024-11-20 14:00:06,548 INFO L125 PetriNetUnfolderBase]: For 714/762 co-relation queries the response was YES. [2024-11-20 14:00:06,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2488 conditions, 1427 events. 177/1427 cut-off events. For 714/762 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11085 event pairs, 135 based on Foata normal form. 3/1315 useless extension candidates. Maximal degree in co-relation 2169. Up to 336 conditions per place. [2024-11-20 14:00:06,552 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 23 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2024-11-20 14:00:06,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 457 flow [2024-11-20 14:00:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2024-11-20 14:00:06,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2024-11-20 14:00:06,554 INFO L175 Difference]: Start difference. First operand has 136 places, 126 transitions, 383 flow. Second operand 3 states and 305 transitions. [2024-11-20 14:00:06,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 457 flow [2024-11-20 14:00:06,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 131 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 14:00:06,556 INFO L231 Difference]: Finished difference. Result has 139 places, 129 transitions, 411 flow [2024-11-20 14:00:06,556 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=139, PETRI_TRANSITIONS=129} [2024-11-20 14:00:06,557 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 22 predicate places. [2024-11-20 14:00:06,557 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 129 transitions, 411 flow [2024-11-20 14:00:06,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:06,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:06,558 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:06,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 14:00:06,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:06,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:06,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2119273415, now seen corresponding path program 1 times [2024-11-20 14:00:06,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:06,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999377795] [2024-11-20 14:00:06,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:06,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999377795] [2024-11-20 14:00:06,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999377795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:00:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742470876] [2024-11-20 14:00:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:06,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:06,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:06,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:00:06,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 14:00:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:06,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:00:06,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:00:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:06,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:00:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:07,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742470876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:00:07,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:00:07,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-11-20 14:00:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458520827] [2024-11-20 14:00:07,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:00:07,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 14:00:07,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:07,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 14:00:07,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-20 14:00:07,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2024-11-20 14:00:07,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 129 transitions, 411 flow. Second operand has 19 states, 19 states have (on average 93.21052631578948) internal successors, (1771), 19 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:07,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:07,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2024-11-20 14:00:07,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:07,347 INFO L124 PetriNetUnfolderBase]: 151/831 cut-off events. [2024-11-20 14:00:07,348 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2024-11-20 14:00:07,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 831 events. 151/831 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4889 event pairs, 0 based on Foata normal form. 20/832 useless extension candidates. Maximal degree in co-relation 1508. Up to 88 conditions per place. [2024-11-20 14:00:07,352 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 50 selfloop transitions, 11 changer transitions 0/125 dead transitions. [2024-11-20 14:00:07,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 125 transitions, 502 flow [2024-11-20 14:00:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:00:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-20 14:00:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1245 transitions. [2024-11-20 14:00:07,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8327759197324415 [2024-11-20 14:00:07,355 INFO L175 Difference]: Start difference. First operand has 139 places, 129 transitions, 411 flow. Second operand 13 states and 1245 transitions. [2024-11-20 14:00:07,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 125 transitions, 502 flow [2024-11-20 14:00:07,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 125 transitions, 463 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-11-20 14:00:07,358 INFO L231 Difference]: Finished difference. Result has 110 places, 87 transitions, 247 flow [2024-11-20 14:00:07,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=247, PETRI_PLACES=110, PETRI_TRANSITIONS=87} [2024-11-20 14:00:07,359 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -7 predicate places. [2024-11-20 14:00:07,359 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 87 transitions, 247 flow [2024-11-20 14:00:07,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 93.21052631578948) internal successors, (1771), 19 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:07,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:07,360 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:07,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 14:00:07,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:07,561 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-20 14:00:07,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:07,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1867873371, now seen corresponding path program 1 times [2024-11-20 14:00:07,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:07,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985734305] [2024-11-20 14:00:07,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:07,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:00:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:07,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:00:07,606 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:00:07,606 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-11-20 14:00:07,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-11-20 14:00:07,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-11-20 14:00:07,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-11-20 14:00:07,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-11-20 14:00:07,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-11-20 14:00:07,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-11-20 14:00:07,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-11-20 14:00:07,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 14:00:07,607 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:07,607 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-20 14:00:07,607 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-20 14:00:07,622 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-20 14:00:07,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 133 transitions, 306 flow [2024-11-20 14:00:07,656 INFO L124 PetriNetUnfolderBase]: 42/595 cut-off events. [2024-11-20 14:00:07,656 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-20 14:00:07,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 595 events. 42/595 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2179 event pairs, 6 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 365. Up to 32 conditions per place. [2024-11-20 14:00:07,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 133 transitions, 306 flow [2024-11-20 14:00:07,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 133 transitions, 306 flow [2024-11-20 14:00:07,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:00:07,661 INFO L333 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, 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;@229e0baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:00:07,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-20 14:00:07,663 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 14:00:07,663 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-20 14:00:07,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 14:00:07,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:07,663 INFO L204 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] [2024-11-20 14:00:07,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:07,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:07,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2057079540, now seen corresponding path program 1 times [2024-11-20 14:00:07,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:07,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760098687] [2024-11-20 14:00:07,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:07,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:07,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760098687] [2024-11-20 14:00:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760098687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:07,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:07,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:00:07,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126121898] [2024-11-20 14:00:07,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:07,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:00:07,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:07,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:00:07,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:00:07,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2024-11-20 14:00:07,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:07,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:07,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2024-11-20 14:00:07,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:08,311 INFO L124 PetriNetUnfolderBase]: 2017/8327 cut-off events. [2024-11-20 14:00:08,311 INFO L125 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2024-11-20 14:00:08,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11728 conditions, 8327 events. 2017/8327 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 85400 event pairs, 1191 based on Foata normal form. 252/7867 useless extension candidates. Maximal degree in co-relation 5299. Up to 2119 conditions per place. [2024-11-20 14:00:08,363 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 30 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2024-11-20 14:00:08,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 142 transitions, 392 flow [2024-11-20 14:00:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:00:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 14:00:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2024-11-20 14:00:08,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8834586466165414 [2024-11-20 14:00:08,365 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 306 flow. Second operand 4 states and 470 transitions. [2024-11-20 14:00:08,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 142 transitions, 392 flow [2024-11-20 14:00:08,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 142 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 14:00:08,368 INFO L231 Difference]: Finished difference. Result has 140 places, 132 transitions, 318 flow [2024-11-20 14:00:08,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=140, PETRI_TRANSITIONS=132} [2024-11-20 14:00:08,369 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 4 predicate places. [2024-11-20 14:00:08,369 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 132 transitions, 318 flow [2024-11-20 14:00:08,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:08,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:08,369 INFO L204 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] [2024-11-20 14:00:08,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 14:00:08,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:08,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1259349106, now seen corresponding path program 1 times [2024-11-20 14:00:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:08,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159992450] [2024-11-20 14:00:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:08,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:08,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:08,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159992450] [2024-11-20 14:00:08,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159992450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:08,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:08,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:08,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592690136] [2024-11-20 14:00:08,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:08,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:08,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:08,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:08,554 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 133 [2024-11-20 14:00:08,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 132 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:08,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:08,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 133 [2024-11-20 14:00:08,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:10,061 INFO L124 PetriNetUnfolderBase]: 6248/15894 cut-off events. [2024-11-20 14:00:10,062 INFO L125 PetriNetUnfolderBase]: For 1589/1589 co-relation queries the response was YES. [2024-11-20 14:00:10,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25970 conditions, 15894 events. 6248/15894 cut-off events. For 1589/1589 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 162585 event pairs, 808 based on Foata normal form. 0/14856 useless extension candidates. Maximal degree in co-relation 9040. Up to 6781 conditions per place. [2024-11-20 14:00:10,140 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 62 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2024-11-20 14:00:10,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 163 transitions, 514 flow [2024-11-20 14:00:10,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2024-11-20 14:00:10,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8057644110275689 [2024-11-20 14:00:10,141 INFO L175 Difference]: Start difference. First operand has 140 places, 132 transitions, 318 flow. Second operand 6 states and 643 transitions. [2024-11-20 14:00:10,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 163 transitions, 514 flow [2024-11-20 14:00:10,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 163 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:10,149 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 320 flow [2024-11-20 14:00:10,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2024-11-20 14:00:10,149 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 6 predicate places. [2024-11-20 14:00:10,149 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 320 flow [2024-11-20 14:00:10,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:10,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:10,149 INFO L204 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] [2024-11-20 14:00:10,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 14:00:10,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:10,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:10,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1751841594, now seen corresponding path program 1 times [2024-11-20 14:00:10,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:10,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495611529] [2024-11-20 14:00:10,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:10,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:10,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495611529] [2024-11-20 14:00:10,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495611529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:10,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:10,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:10,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976316121] [2024-11-20 14:00:10,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:10,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:10,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:10,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:10,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-20 14:00:10,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:10,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:10,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-20 14:00:10,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:12,397 INFO L124 PetriNetUnfolderBase]: 7178/23603 cut-off events. [2024-11-20 14:00:12,397 INFO L125 PetriNetUnfolderBase]: For 4700/5942 co-relation queries the response was YES. [2024-11-20 14:00:12,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35693 conditions, 23603 events. 7178/23603 cut-off events. For 4700/5942 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 286780 event pairs, 4486 based on Foata normal form. 11/20852 useless extension candidates. Maximal degree in co-relation 12989. Up to 8464 conditions per place. [2024-11-20 14:00:12,568 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 36 selfloop transitions, 7 changer transitions 0/149 dead transitions. [2024-11-20 14:00:12,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 149 transitions, 472 flow [2024-11-20 14:00:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2024-11-20 14:00:12,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9072681704260651 [2024-11-20 14:00:12,569 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 320 flow. Second operand 3 states and 362 transitions. [2024-11-20 14:00:12,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 149 transitions, 472 flow [2024-11-20 14:00:12,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 149 transitions, 462 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 14:00:12,573 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 364 flow [2024-11-20 14:00:12,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2024-11-20 14:00:12,573 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 5 predicate places. [2024-11-20 14:00:12,573 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 364 flow [2024-11-20 14:00:12,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:12,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:12,574 INFO L204 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] [2024-11-20 14:00:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 14:00:12,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:12,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1573180249, now seen corresponding path program 1 times [2024-11-20 14:00:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705691633] [2024-11-20 14:00:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:00:12,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:12,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705691633] [2024-11-20 14:00:12,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705691633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:12,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:12,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:00:12,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013565744] [2024-11-20 14:00:12,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:12,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:00:12,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:00:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:00:12,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2024-11-20 14:00:12,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:12,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:12,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2024-11-20 14:00:12,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:14,572 INFO L124 PetriNetUnfolderBase]: 5437/19811 cut-off events. [2024-11-20 14:00:14,572 INFO L125 PetriNetUnfolderBase]: For 2732/2798 co-relation queries the response was YES. [2024-11-20 14:00:14,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30233 conditions, 19811 events. 5437/19811 cut-off events. For 2732/2798 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 241495 event pairs, 2945 based on Foata normal form. 259/17673 useless extension candidates. Maximal degree in co-relation 24434. Up to 3835 conditions per place. [2024-11-20 14:00:14,668 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 40 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2024-11-20 14:00:14,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 158 transitions, 506 flow [2024-11-20 14:00:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:00:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 14:00:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2024-11-20 14:00:14,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8966165413533834 [2024-11-20 14:00:14,674 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 364 flow. Second operand 4 states and 477 transitions. [2024-11-20 14:00:14,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 158 transitions, 506 flow [2024-11-20 14:00:14,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 158 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:14,690 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 366 flow [2024-11-20 14:00:14,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2024-11-20 14:00:14,691 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 7 predicate places. [2024-11-20 14:00:14,691 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 366 flow [2024-11-20 14:00:14,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:14,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:14,691 INFO L204 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] [2024-11-20 14:00:14,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 14:00:14,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:14,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:14,692 INFO L85 PathProgramCache]: Analyzing trace with hash -115188152, now seen corresponding path program 1 times [2024-11-20 14:00:14,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:14,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317984380] [2024-11-20 14:00:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:14,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317984380] [2024-11-20 14:00:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317984380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:00:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073401871] [2024-11-20 14:00:14,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:14,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:14,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:14,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:00:14,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 14:00:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:14,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:00:14,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:00:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:14,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:00:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:14,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073401871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:00:14,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:00:14,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-20 14:00:14,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131440556] [2024-11-20 14:00:14,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:00:14,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:00:14,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:14,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:00:14,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:00:15,003 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 133 [2024-11-20 14:00:15,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 366 flow. Second operand has 13 states, 13 states have (on average 106.92307692307692) internal successors, (1390), 13 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:15,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:15,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 133 [2024-11-20 14:00:15,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:17,763 INFO L124 PetriNetUnfolderBase]: 6978/25523 cut-off events. [2024-11-20 14:00:17,763 INFO L125 PetriNetUnfolderBase]: For 3257/3257 co-relation queries the response was YES. [2024-11-20 14:00:17,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39069 conditions, 25523 events. 6978/25523 cut-off events. For 3257/3257 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 321094 event pairs, 1505 based on Foata normal form. 15/22059 useless extension candidates. Maximal degree in co-relation 18423. Up to 4886 conditions per place. [2024-11-20 14:00:17,912 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 58 selfloop transitions, 11 changer transitions 0/180 dead transitions. [2024-11-20 14:00:17,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 180 transitions, 590 flow [2024-11-20 14:00:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:00:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 14:00:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1121 transitions. [2024-11-20 14:00:17,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8428571428571429 [2024-11-20 14:00:17,914 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 366 flow. Second operand 10 states and 1121 transitions. [2024-11-20 14:00:17,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 180 transitions, 590 flow [2024-11-20 14:00:17,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 180 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:17,936 INFO L231 Difference]: Finished difference. Result has 153 places, 144 transitions, 416 flow [2024-11-20 14:00:17,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=416, PETRI_PLACES=153, PETRI_TRANSITIONS=144} [2024-11-20 14:00:17,937 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 17 predicate places. [2024-11-20 14:00:17,937 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 144 transitions, 416 flow [2024-11-20 14:00:17,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 106.92307692307692) internal successors, (1390), 13 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:17,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:17,937 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:17,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 14:00:18,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-20 14:00:18,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:18,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:18,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1513130808, now seen corresponding path program 1 times [2024-11-20 14:00:18,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:18,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967871351] [2024-11-20 14:00:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-20 14:00:18,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:18,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967871351] [2024-11-20 14:00:18,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967871351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:18,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:18,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210903212] [2024-11-20 14:00:18,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:18,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:18,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:18,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:18,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-20 14:00:18,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 144 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:18,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:18,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-20 14:00:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:21,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L698-->L698-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][156], [162#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 88#L698-1true, 79#L686true, 131#true, 84#L685-6true, 134#true, 133#true, Black: 428#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 142#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 261#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 136#true, 432#true, Black: 152#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), Black: 158#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|))]) [2024-11-20 14:00:21,763 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-20 14:00:21,764 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-20 14:00:21,764 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-11-20 14:00:21,764 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-11-20 14:00:21,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([476] L698-->L698-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][156], [20#L686-3true, 162#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 88#L698-1true, 131#true, 84#L685-6true, 133#true, 134#true, Black: 428#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~threads_total~0#1|)), Black: 142#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 261#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 136#true, 432#true, Black: 152#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|), Black: 158#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|))]) [2024-11-20 14:00:21,773 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-20 14:00:21,773 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-20 14:00:21,773 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-20 14:00:21,773 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-20 14:00:21,824 INFO L124 PetriNetUnfolderBase]: 8673/29230 cut-off events. [2024-11-20 14:00:21,825 INFO L125 PetriNetUnfolderBase]: For 10638/11793 co-relation queries the response was YES. [2024-11-20 14:00:21,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50760 conditions, 29230 events. 8673/29230 cut-off events. For 10638/11793 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 377384 event pairs, 5334 based on Foata normal form. 26/26339 useless extension candidates. Maximal degree in co-relation 41932. Up to 9950 conditions per place. [2024-11-20 14:00:22,050 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 38 selfloop transitions, 11 changer transitions 0/164 dead transitions. [2024-11-20 14:00:22,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 164 transitions, 593 flow [2024-11-20 14:00:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-11-20 14:00:22,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-20 14:00:22,052 INFO L175 Difference]: Start difference. First operand has 153 places, 144 transitions, 416 flow. Second operand 3 states and 361 transitions. [2024-11-20 14:00:22,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 164 transitions, 593 flow [2024-11-20 14:00:22,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 164 transitions, 585 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:22,088 INFO L231 Difference]: Finished difference. Result has 155 places, 153 transitions, 504 flow [2024-11-20 14:00:22,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=155, PETRI_TRANSITIONS=153} [2024-11-20 14:00:22,089 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 19 predicate places. [2024-11-20 14:00:22,089 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 153 transitions, 504 flow [2024-11-20 14:00:22,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:22,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:22,093 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:22,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-20 14:00:22,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:22,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash -185948868, now seen corresponding path program 1 times [2024-11-20 14:00:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:22,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432491604] [2024-11-20 14:00:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-20 14:00:22,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:22,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432491604] [2024-11-20 14:00:22,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432491604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:22,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:22,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:00:22,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612096006] [2024-11-20 14:00:22,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:22,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:22,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:22,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:22,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:22,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 133 [2024-11-20 14:00:22,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 153 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:22,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:22,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 133 [2024-11-20 14:00:22,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:22,898 INFO L124 PetriNetUnfolderBase]: 472/4812 cut-off events. [2024-11-20 14:00:22,898 INFO L125 PetriNetUnfolderBase]: For 1489/1635 co-relation queries the response was YES. [2024-11-20 14:00:22,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7431 conditions, 4812 events. 472/4812 cut-off events. For 1489/1635 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 51996 event pairs, 234 based on Foata normal form. 128/4549 useless extension candidates. Maximal degree in co-relation 5367. Up to 454 conditions per place. [2024-11-20 14:00:22,919 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 16 selfloop transitions, 8 changer transitions 0/151 dead transitions. [2024-11-20 14:00:22,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 151 transitions, 531 flow [2024-11-20 14:00:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2024-11-20 14:00:22,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9273182957393483 [2024-11-20 14:00:22,921 INFO L175 Difference]: Start difference. First operand has 155 places, 153 transitions, 504 flow. Second operand 3 states and 370 transitions. [2024-11-20 14:00:22,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 151 transitions, 531 flow [2024-11-20 14:00:22,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 151 transitions, 519 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:22,930 INFO L231 Difference]: Finished difference. Result has 155 places, 144 transitions, 440 flow [2024-11-20 14:00:22,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=155, PETRI_TRANSITIONS=144} [2024-11-20 14:00:22,931 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 19 predicate places. [2024-11-20 14:00:22,931 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 144 transitions, 440 flow [2024-11-20 14:00:22,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:22,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:22,931 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:22,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-20 14:00:22,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:22,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash -173072363, now seen corresponding path program 1 times [2024-11-20 14:00:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:22,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926674540] [2024-11-20 14:00:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-20 14:00:22,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926674540] [2024-11-20 14:00:22,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926674540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:22,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:22,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:22,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929463071] [2024-11-20 14:00:22,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:22,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:22,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:22,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:22,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-20 14:00:22,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 144 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:22,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:22,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-20 14:00:22,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:23,656 INFO L124 PetriNetUnfolderBase]: 928/5648 cut-off events. [2024-11-20 14:00:23,656 INFO L125 PetriNetUnfolderBase]: For 3503/3647 co-relation queries the response was YES. [2024-11-20 14:00:23,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10258 conditions, 5648 events. 928/5648 cut-off events. For 3503/3647 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 62888 event pairs, 707 based on Foata normal form. 7/5136 useless extension candidates. Maximal degree in co-relation 7438. Up to 1545 conditions per place. [2024-11-20 14:00:23,676 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 30 selfloop transitions, 4 changer transitions 0/151 dead transitions. [2024-11-20 14:00:23,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 151 transitions, 544 flow [2024-11-20 14:00:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2024-11-20 14:00:23,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8796992481203008 [2024-11-20 14:00:23,677 INFO L175 Difference]: Start difference. First operand has 155 places, 144 transitions, 440 flow. Second operand 3 states and 351 transitions. [2024-11-20 14:00:23,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 151 transitions, 544 flow [2024-11-20 14:00:23,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 151 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 14:00:23,684 INFO L231 Difference]: Finished difference. Result has 158 places, 147 transitions, 466 flow [2024-11-20 14:00:23,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=158, PETRI_TRANSITIONS=147} [2024-11-20 14:00:23,686 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 22 predicate places. [2024-11-20 14:00:23,686 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 147 transitions, 466 flow [2024-11-20 14:00:23,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:23,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:23,686 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:23,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-20 14:00:23,688 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:23,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:23,689 INFO L85 PathProgramCache]: Analyzing trace with hash -986148343, now seen corresponding path program 1 times [2024-11-20 14:00:23,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:23,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997932377] [2024-11-20 14:00:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:23,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:23,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:23,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997932377] [2024-11-20 14:00:23,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997932377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:00:23,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41216796] [2024-11-20 14:00:23,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:23,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:23,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:23,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:00:23,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 14:00:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:23,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:00:23,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:00:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:24,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:00:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41216796] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:00:24,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:00:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-11-20 14:00:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765806060] [2024-11-20 14:00:24,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:00:24,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 14:00:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:24,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 14:00:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-20 14:00:24,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 133 [2024-11-20 14:00:24,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 147 transitions, 466 flow. Second operand has 19 states, 19 states have (on average 107.21052631578948) internal successors, (2037), 19 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:24,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:24,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 133 [2024-11-20 14:00:24,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:25,190 INFO L124 PetriNetUnfolderBase]: 1216/8424 cut-off events. [2024-11-20 14:00:25,190 INFO L125 PetriNetUnfolderBase]: For 3420/3686 co-relation queries the response was YES. [2024-11-20 14:00:25,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14053 conditions, 8424 events. 1216/8424 cut-off events. For 3420/3686 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 91526 event pairs, 183 based on Foata normal form. 20/7707 useless extension candidates. Maximal degree in co-relation 5658. Up to 893 conditions per place. [2024-11-20 14:00:25,229 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 84 selfloop transitions, 14 changer transitions 1/213 dead transitions. [2024-11-20 14:00:25,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 213 transitions, 872 flow [2024-11-20 14:00:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:00:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-20 14:00:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1570 transitions. [2024-11-20 14:00:25,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8431793770139635 [2024-11-20 14:00:25,231 INFO L175 Difference]: Start difference. First operand has 158 places, 147 transitions, 466 flow. Second operand 14 states and 1570 transitions. [2024-11-20 14:00:25,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 213 transitions, 872 flow [2024-11-20 14:00:25,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 213 transitions, 860 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:25,238 INFO L231 Difference]: Finished difference. Result has 173 places, 151 transitions, 521 flow [2024-11-20 14:00:25,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=521, PETRI_PLACES=173, PETRI_TRANSITIONS=151} [2024-11-20 14:00:25,239 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 37 predicate places. [2024-11-20 14:00:25,239 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 151 transitions, 521 flow [2024-11-20 14:00:25,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 107.21052631578948) internal successors, (2037), 19 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:25,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:25,240 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:25,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-20 14:00:25,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:25,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:25,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:25,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1275886185, now seen corresponding path program 1 times [2024-11-20 14:00:25,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354313383] [2024-11-20 14:00:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:25,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 14:00:25,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:25,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354313383] [2024-11-20 14:00:25,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354313383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:25,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:25,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068795806] [2024-11-20 14:00:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:25,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:25,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:25,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:25,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:25,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-20 14:00:25,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 151 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:25,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:25,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-20 14:00:25,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:26,012 INFO L124 PetriNetUnfolderBase]: 883/5710 cut-off events. [2024-11-20 14:00:26,013 INFO L125 PetriNetUnfolderBase]: For 4222/4318 co-relation queries the response was YES. [2024-11-20 14:00:26,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10775 conditions, 5710 events. 883/5710 cut-off events. For 4222/4318 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 62597 event pairs, 677 based on Foata normal form. 4/5205 useless extension candidates. Maximal degree in co-relation 9961. Up to 1476 conditions per place. [2024-11-20 14:00:26,038 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 30 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2024-11-20 14:00:26,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 157 transitions, 616 flow [2024-11-20 14:00:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2024-11-20 14:00:26,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8771929824561403 [2024-11-20 14:00:26,039 INFO L175 Difference]: Start difference. First operand has 173 places, 151 transitions, 521 flow. Second operand 3 states and 350 transitions. [2024-11-20 14:00:26,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 157 transitions, 616 flow [2024-11-20 14:00:26,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 157 transitions, 598 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-11-20 14:00:26,057 INFO L231 Difference]: Finished difference. Result has 170 places, 154 transitions, 539 flow [2024-11-20 14:00:26,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=170, PETRI_TRANSITIONS=154} [2024-11-20 14:00:26,059 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 34 predicate places. [2024-11-20 14:00:26,059 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 154 transitions, 539 flow [2024-11-20 14:00:26,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:26,060 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:26,060 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:26,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-20 14:00:26,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:26,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:26,060 INFO L85 PathProgramCache]: Analyzing trace with hash 567923831, now seen corresponding path program 1 times [2024-11-20 14:00:26,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:26,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718913809] [2024-11-20 14:00:26,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:26,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-20 14:00:26,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:26,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718913809] [2024-11-20 14:00:26,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718913809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:26,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:26,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:00:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252752822] [2024-11-20 14:00:26,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:26,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:00:26,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:26,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:00:26,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:00:26,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 133 [2024-11-20 14:00:26,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 154 transitions, 539 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:26,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:26,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 133 [2024-11-20 14:00:26,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:27,488 INFO L124 PetriNetUnfolderBase]: 2726/11410 cut-off events. [2024-11-20 14:00:27,489 INFO L125 PetriNetUnfolderBase]: For 5193/5497 co-relation queries the response was YES. [2024-11-20 14:00:27,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22042 conditions, 11410 events. 2726/11410 cut-off events. For 5193/5497 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 124844 event pairs, 1342 based on Foata normal form. 0/10706 useless extension candidates. Maximal degree in co-relation 19751. Up to 2509 conditions per place. [2024-11-20 14:00:27,528 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 59 selfloop transitions, 6 changer transitions 0/185 dead transitions. [2024-11-20 14:00:27,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 185 transitions, 763 flow [2024-11-20 14:00:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:00:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 14:00:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2024-11-20 14:00:27,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.818295739348371 [2024-11-20 14:00:27,529 INFO L175 Difference]: Start difference. First operand has 170 places, 154 transitions, 539 flow. Second operand 6 states and 653 transitions. [2024-11-20 14:00:27,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 185 transitions, 763 flow [2024-11-20 14:00:27,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 185 transitions, 749 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:27,565 INFO L231 Difference]: Finished difference. Result has 172 places, 153 transitions, 535 flow [2024-11-20 14:00:27,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=535, PETRI_PLACES=172, PETRI_TRANSITIONS=153} [2024-11-20 14:00:27,566 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 36 predicate places. [2024-11-20 14:00:27,566 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 153 transitions, 535 flow [2024-11-20 14:00:27,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:27,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:27,567 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:27,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-20 14:00:27,567 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:27,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash -169137220, now seen corresponding path program 1 times [2024-11-20 14:00:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:27,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702868177] [2024-11-20 14:00:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:27,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 97 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:27,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702868177] [2024-11-20 14:00:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702868177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:00:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709085293] [2024-11-20 14:00:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:27,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:27,713 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:00:27,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 14:00:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:27,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 14:00:27,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:00:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:00:28,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:00:28,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709085293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:28,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:00:28,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21 [2024-11-20 14:00:28,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84027370] [2024-11-20 14:00:28,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:28,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:00:28,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:28,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:00:28,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-20 14:00:28,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-20 14:00:28,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 153 transitions, 535 flow. Second operand has 12 states, 12 states have (on average 108.0) internal successors, (1296), 12 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:28,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:28,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-20 14:00:28,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:29,294 INFO L124 PetriNetUnfolderBase]: 1122/7497 cut-off events. [2024-11-20 14:00:29,295 INFO L125 PetriNetUnfolderBase]: For 4525/4761 co-relation queries the response was YES. [2024-11-20 14:00:29,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14207 conditions, 7497 events. 1122/7497 cut-off events. For 4525/4761 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 80005 event pairs, 170 based on Foata normal form. 48/7001 useless extension candidates. Maximal degree in co-relation 5022. Up to 572 conditions per place. [2024-11-20 14:00:29,330 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 89 selfloop transitions, 16 changer transitions 8/229 dead transitions. [2024-11-20 14:00:29,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 229 transitions, 982 flow [2024-11-20 14:00:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 14:00:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-20 14:00:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1810 transitions. [2024-11-20 14:00:29,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8505639097744361 [2024-11-20 14:00:29,333 INFO L175 Difference]: Start difference. First operand has 172 places, 153 transitions, 535 flow. Second operand 16 states and 1810 transitions. [2024-11-20 14:00:29,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 229 transitions, 982 flow [2024-11-20 14:00:29,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 229 transitions, 962 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-20 14:00:29,344 INFO L231 Difference]: Finished difference. Result has 177 places, 151 transitions, 532 flow [2024-11-20 14:00:29,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=532, PETRI_PLACES=177, PETRI_TRANSITIONS=151} [2024-11-20 14:00:29,344 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 41 predicate places. [2024-11-20 14:00:29,344 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 151 transitions, 532 flow [2024-11-20 14:00:29,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 108.0) internal successors, (1296), 12 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:29,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:29,345 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:29,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-20 14:00:29,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:29,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:29,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash 651977579, now seen corresponding path program 1 times [2024-11-20 14:00:29,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:29,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135724844] [2024-11-20 14:00:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:29,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-20 14:00:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135724844] [2024-11-20 14:00:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135724844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:00:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:00:29,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:00:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017349171] [2024-11-20 14:00:29,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:00:29,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:00:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:29,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:00:29,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:00:29,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2024-11-20 14:00:29,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 151 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:29,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:29,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2024-11-20 14:00:29,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:30,524 INFO L124 PetriNetUnfolderBase]: 1353/8934 cut-off events. [2024-11-20 14:00:30,524 INFO L125 PetriNetUnfolderBase]: For 5607/5691 co-relation queries the response was YES. [2024-11-20 14:00:30,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17244 conditions, 8934 events. 1353/8934 cut-off events. For 5607/5691 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 106336 event pairs, 605 based on Foata normal form. 0/8374 useless extension candidates. Maximal degree in co-relation 16459. Up to 1591 conditions per place. [2024-11-20 14:00:30,557 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 30 selfloop transitions, 9 changer transitions 1/164 dead transitions. [2024-11-20 14:00:30,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 164 transitions, 666 flow [2024-11-20 14:00:30,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:00:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 14:00:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-11-20 14:00:30,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-20 14:00:30,559 INFO L175 Difference]: Start difference. First operand has 177 places, 151 transitions, 532 flow. Second operand 3 states and 361 transitions. [2024-11-20 14:00:30,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 164 transitions, 666 flow [2024-11-20 14:00:30,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 164 transitions, 612 flow, removed 3 selfloop flow, removed 17 redundant places. [2024-11-20 14:00:30,646 INFO L231 Difference]: Finished difference. Result has 164 places, 155 transitions, 554 flow [2024-11-20 14:00:30,646 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=164, PETRI_TRANSITIONS=155} [2024-11-20 14:00:30,647 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 28 predicate places. [2024-11-20 14:00:30,648 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 155 transitions, 554 flow [2024-11-20 14:00:30,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:30,648 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:30,648 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:30,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-20 14:00:30,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:30,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:30,649 INFO L85 PathProgramCache]: Analyzing trace with hash -651162024, now seen corresponding path program 1 times [2024-11-20 14:00:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:30,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3154358] [2024-11-20 14:00:30,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-20 14:00:30,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:00:30,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3154358] [2024-11-20 14:00:30,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3154358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:00:30,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63246404] [2024-11-20 14:00:30,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:30,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:00:30,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:00:30,811 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:00:30,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 14:00:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:00:30,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:00:30,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:00:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-20 14:00:31,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:00:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-20 14:00:31,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63246404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:00:31,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:00:31,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-20 14:00:31,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042888385] [2024-11-20 14:00:31,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:00:31,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:00:31,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:00:31,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:00:31,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:00:31,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 133 [2024-11-20 14:00:31,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 155 transitions, 554 flow. Second operand has 12 states, 12 states have (on average 108.33333333333333) internal successors, (1300), 12 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:31,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 14:00:31,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 133 [2024-11-20 14:00:31,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 14:00:31,719 INFO L124 PetriNetUnfolderBase]: 1050/4174 cut-off events. [2024-11-20 14:00:31,719 INFO L125 PetriNetUnfolderBase]: For 1809/1831 co-relation queries the response was YES. [2024-11-20 14:00:31,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7772 conditions, 4174 events. 1050/4174 cut-off events. For 1809/1831 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 35456 event pairs, 97 based on Foata normal form. 128/4263 useless extension candidates. Maximal degree in co-relation 7099. Up to 518 conditions per place. [2024-11-20 14:00:31,735 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 88 selfloop transitions, 10 changer transitions 17/235 dead transitions. [2024-11-20 14:00:31,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 235 transitions, 1014 flow [2024-11-20 14:00:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:00:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 14:00:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1159 transitions. [2024-11-20 14:00:31,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8714285714285714 [2024-11-20 14:00:31,736 INFO L175 Difference]: Start difference. First operand has 164 places, 155 transitions, 554 flow. Second operand 10 states and 1159 transitions. [2024-11-20 14:00:31,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 235 transitions, 1014 flow [2024-11-20 14:00:31,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 235 transitions, 996 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 14:00:31,741 INFO L231 Difference]: Finished difference. Result has 174 places, 152 transitions, 554 flow [2024-11-20 14:00:31,741 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=554, PETRI_PLACES=174, PETRI_TRANSITIONS=152} [2024-11-20 14:00:31,741 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 38 predicate places. [2024-11-20 14:00:31,741 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 152 transitions, 554 flow [2024-11-20 14:00:31,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 108.33333333333333) internal successors, (1300), 12 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:00:31,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 14:00:31,742 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:31,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 14:00:31,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-20 14:00:31,943 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-20 14:00:31,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:00:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash 603650889, now seen corresponding path program 1 times [2024-11-20 14:00:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:00:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311319176] [2024-11-20 14:00:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:00:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:00:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:31,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:00:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:00:32,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:00:32,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:00:32,002 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2024-11-20 14:00:32,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-20 14:00:32,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-20 14:00:32,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-20 14:00:32,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-11-20 14:00:32,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-20 14:00:32,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-20 14:00:32,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-20 14:00:32,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-20 14:00:32,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-20 14:00:32,003 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:00:32,118 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2024-11-20 14:00:32,118 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 14:00:32,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:00:32 BasicIcfg [2024-11-20 14:00:32,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 14:00:32,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 14:00:32,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 14:00:32,124 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 14:00:32,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:59:58" (3/4) ... [2024-11-20 14:00:32,125 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 14:00:32,217 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 14:00:32,217 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 14:00:32,217 INFO L158 Benchmark]: Toolchain (without parser) took 34579.87ms. Allocated memory was 155.2MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 81.8MB in the beginning and 9.6GB in the end (delta: -9.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-20 14:00:32,217 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory was 106.8MB in the beginning and 106.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:00:32,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.01ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 81.6MB in the beginning and 197.8MB in the end (delta: -116.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-20 14:00:32,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.31ms. Allocated memory is still 234.9MB. Free memory was 197.8MB in the beginning and 195.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:00:32,218 INFO L158 Benchmark]: Boogie Preprocessor took 43.33ms. Allocated memory is still 234.9MB. Free memory was 195.7MB in the beginning and 193.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:00:32,218 INFO L158 Benchmark]: RCFGBuilder took 323.22ms. Allocated memory is still 234.9MB. Free memory was 193.6MB in the beginning and 177.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 14:00:32,218 INFO L158 Benchmark]: TraceAbstraction took 33472.26ms. Allocated memory was 234.9MB in the beginning and 11.0GB in the end (delta: 10.8GB). Free memory was 176.8MB in the beginning and 9.7GB in the end (delta: -9.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-20 14:00:32,219 INFO L158 Benchmark]: Witness Printer took 93.05ms. Allocated memory is still 11.0GB. Free memory was 9.7GB in the beginning and 9.6GB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-20 14:00:32,220 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.13ms. Allocated memory is still 155.2MB. Free memory was 106.8MB in the beginning and 106.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.01ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 81.6MB in the beginning and 197.8MB in the end (delta: -116.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.31ms. Allocated memory is still 234.9MB. Free memory was 197.8MB in the beginning and 195.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.33ms. Allocated memory is still 234.9MB. Free memory was 195.7MB in the beginning and 193.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 323.22ms. Allocated memory is still 234.9MB. Free memory was 193.6MB in the beginning and 177.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33472.26ms. Allocated memory was 234.9MB in the beginning and 11.0GB in the end (delta: 10.8GB). Free memory was 176.8MB in the beginning and 9.7GB in the end (delta: -9.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 93.05ms. Allocated memory is still 11.0GB. Free memory was 9.7GB in the beginning and 9.6GB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L681] 0 int data = 0; VAL [data=0] [L682] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L690] 0 int threads_total = 4; VAL [data=0, data_mutex={1:0}, threads_total=4] [L691] 0 pthread_t tids[4]; VAL [data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L692] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L685] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 3 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 3 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L685] 4 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L687] 3 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L692] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L695] 0 int i = 0; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L687] 1 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L695] COND TRUE 0 i < threads_total - 1 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] FCALL, JOIN 1 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total - 1 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L687] 2 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] FCALL, JOIN 2 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L695] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total - 1 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] FCALL, JOIN 3 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L695] COND FALSE 0 !(i < threads_total - 1) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L698] 0 return data; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L685] 4 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [698] and C: data = __VERIFIER_nondet_int() [685] - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 94 locations, 6 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.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 521 IncrementalHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 9 mSDtfsCounter, 521 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 709 SizeOfPredicates, 4 NumberOfNonLiveVariables, 115 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 111 locations, 7 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: 1.8s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 308 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 662 IncrementalHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 17 mSDtfsCounter, 662 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=4, InterpolantAutomatonStates: 30, 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.5s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 762 SizeOfPredicates, 4 NumberOfNonLiveVariables, 115 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 128 locations, 8 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: 4.8s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 850 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 675 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1261 IncrementalHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 38 mSDtfsCounter, 1261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 225 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 643 ConstructedInterpolants, 0 QuantifiedInterpolants, 1924 SizeOfPredicates, 12 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 62/227 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 145 locations, 9 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: 24.4s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1607 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1318 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 297 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2679 IncrementalHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 101 mSDtfsCounter, 2679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 665 GetRequests, 558 SyntacticMatches, 7 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=554occurred in iteration=13, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1451 NumberOfCodeBlocks, 1451 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1494 ConstructedInterpolants, 0 QuantifiedInterpolants, 4486 SizeOfPredicates, 26 NumberOfNonLiveVariables, 933 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 920/1137 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-20 14:00:32,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE