./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-counter-outer-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 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-counter-outer-race-2.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 d12d10876782f724294e520e736e39c29f3c74eafacabb114f7449f7b8388c75 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:39:25,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:39:25,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:39:25,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:39:25,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:39:25,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:39:25,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:39:25,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:39:25,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:39:25,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:39:25,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:39:25,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:39:25,560 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:39:25,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:39:25,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:39:25,561 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:39:25,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:39:25,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:39:25,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:39:25,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:39:25,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:39:25,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:39:25,570 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:39:25,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:39:25,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:39:25,571 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:39:25,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:39:25,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:39:25,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:39:25,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:39:25,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:39:25,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:39:25,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:39:25,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:39:25,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:39:25,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:39:25,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:39:25,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:39:25,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:39:25,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:39:25,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:39:25,576 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 -> d12d10876782f724294e520e736e39c29f3c74eafacabb114f7449f7b8388c75 [2024-10-24 15:39:25,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:39:25,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:39:25,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:39:25,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:39:25,846 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:39:25,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-2.i [2024-10-24 15:39:27,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:39:27,578 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:39:27,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-2.i [2024-10-24 15:39:27,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c8f06071/a1778eb06a6e43d783aed6195557cf07/FLAG3c38abfb3 [2024-10-24 15:39:27,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c8f06071/a1778eb06a6e43d783aed6195557cf07 [2024-10-24 15:39:27,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:39:27,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:39:27,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:39:27,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:39:27,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:39:27,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:39:27" (1/1) ... [2024-10-24 15:39:27,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d7e4588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:27, skipping insertion in model container [2024-10-24 15:39:27,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:39:27" (1/1) ... [2024-10-24 15:39:27,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:39:28,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:39:28,017 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:39:28,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:39:28,109 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:39:28,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28 WrapperNode [2024-10-24 15:39:28,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:39:28,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:39:28,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:39:28,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:39:28,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,157 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2024-10-24 15:39:28,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:39:28,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:39:28,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:39:28,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:39:28,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:39:28,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:39:28,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:39:28,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:39:28,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (1/1) ... [2024-10-24 15:39:28,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:39:28,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:39:28,237 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-10-24 15:39:28,241 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-10-24 15:39:28,286 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 15:39:28,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:39:28,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:39:28,287 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-24 15:39:28,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-24 15:39:28,287 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 15:39:28,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:39:28,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:39:28,289 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:39:28,457 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:39:28,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:39:28,730 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:39:28,730 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:39:28,769 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:39:28,769 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 15:39:28,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:28 BoogieIcfgContainer [2024-10-24 15:39:28,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:39:28,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:39:28,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:39:28,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:39:28,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:39:27" (1/3) ... [2024-10-24 15:39:28,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455120c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:39:28, skipping insertion in model container [2024-10-24 15:39:28,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:39:28" (2/3) ... [2024-10-24 15:39:28,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455120c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:39:28, skipping insertion in model container [2024-10-24 15:39:28,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:28" (3/3) ... [2024-10-24 15:39:28,785 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-2.i [2024-10-24 15:39:28,801 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:39:28,802 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-24 15:39:28,802 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:39:28,875 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 15:39:28,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:29,001 INFO L124 PetriNetUnfolderBase]: 7/181 cut-off events. [2024-10-24 15:39:29,001 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:29,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 181 events. 7/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 241 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 98. Up to 4 conditions per place. [2024-10-24 15:39:29,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:29,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 139 transitions, 282 flow [2024-10-24 15:39:29,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:29,033 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;@72346583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:29,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-24 15:39:29,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:29,080 INFO L124 PetriNetUnfolderBase]: 2/65 cut-off events. [2024-10-24 15:39:29,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:29,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:29,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:29,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:29,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1261458737, now seen corresponding path program 1 times [2024-10-24 15:39:29,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:29,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981131303] [2024-10-24 15:39:29,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:29,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:29,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:29,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981131303] [2024-10-24 15:39:29,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981131303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:29,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:29,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58471011] [2024-10-24 15:39:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:29,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:29,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:29,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:29,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:29,517 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2024-10-24 15:39:29,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 139 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-10-24 15:39:29,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:29,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2024-10-24 15:39:29,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:29,736 INFO L124 PetriNetUnfolderBase]: 116/726 cut-off events. [2024-10-24 15:39:29,736 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 15:39:29,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 726 events. 116/726 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4264 event pairs, 37 based on Foata normal form. 8/660 useless extension candidates. Maximal degree in co-relation 880. Up to 144 conditions per place. [2024-10-24 15:39:29,746 INFO L140 encePairwiseOnDemand]: 125/139 looper letters, 32 selfloop transitions, 8 changer transitions 1/154 dead transitions. [2024-10-24 15:39:29,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 154 transitions, 392 flow [2024-10-24 15:39:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2024-10-24 15:39:29,762 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935251798561151 [2024-10-24 15:39:29,765 INFO L175 Difference]: Start difference. First operand has 138 places, 139 transitions, 282 flow. Second operand 3 states and 390 transitions. [2024-10-24 15:39:29,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 154 transitions, 392 flow [2024-10-24 15:39:29,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 154 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:39:29,775 INFO L231 Difference]: Finished difference. Result has 142 places, 143 transitions, 344 flow [2024-10-24 15:39:29,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=142, PETRI_TRANSITIONS=143} [2024-10-24 15:39:29,783 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 4 predicate places. [2024-10-24 15:39:29,784 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 143 transitions, 344 flow [2024-10-24 15:39:29,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-10-24 15:39:29,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:29,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:29,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:39:29,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:29,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:29,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2118150642, now seen corresponding path program 1 times [2024-10-24 15:39:29,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:29,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394643616] [2024-10-24 15:39:29,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:29,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:29,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394643616] [2024-10-24 15:39:29,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394643616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:29,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:29,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:29,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263832193] [2024-10-24 15:39:29,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:29,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:29,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:29,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:29,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:29,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 139 [2024-10-24 15:39:29,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 143 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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-10-24 15:39:29,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:29,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 139 [2024-10-24 15:39:29,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:30,169 INFO L124 PetriNetUnfolderBase]: 134/864 cut-off events. [2024-10-24 15:39:30,171 INFO L125 PetriNetUnfolderBase]: For 166/171 co-relation queries the response was YES. [2024-10-24 15:39:30,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 864 events. 134/864 cut-off events. For 166/171 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5579 event pairs, 84 based on Foata normal form. 4/791 useless extension candidates. Maximal degree in co-relation 1226. Up to 266 conditions per place. [2024-10-24 15:39:30,180 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 29 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2024-10-24 15:39:30,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 444 flow [2024-10-24 15:39:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-10-24 15:39:30,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.894484412470024 [2024-10-24 15:39:30,185 INFO L175 Difference]: Start difference. First operand has 142 places, 143 transitions, 344 flow. Second operand 3 states and 373 transitions. [2024-10-24 15:39:30,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 444 flow [2024-10-24 15:39:30,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:30,195 INFO L231 Difference]: Finished difference. Result has 143 places, 148 transitions, 384 flow [2024-10-24 15:39:30,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=143, PETRI_TRANSITIONS=148} [2024-10-24 15:39:30,196 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 5 predicate places. [2024-10-24 15:39:30,196 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 148 transitions, 384 flow [2024-10-24 15:39:30,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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-10-24 15:39:30,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:30,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:30,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:39:30,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:30,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1145266464, now seen corresponding path program 1 times [2024-10-24 15:39:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:30,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111338199] [2024-10-24 15:39:30,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:30,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:30,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111338199] [2024-10-24 15:39:30,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111338199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:30,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:30,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:30,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959729799] [2024-10-24 15:39:30,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:30,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:30,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:30,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:30,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2024-10-24 15:39:30,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 148 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-10-24 15:39:30,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:30,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2024-10-24 15:39:30,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:30,463 INFO L124 PetriNetUnfolderBase]: 93/801 cut-off events. [2024-10-24 15:39:30,463 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-10-24 15:39:30,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 801 events. 93/801 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5213 event pairs, 51 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 1035. Up to 147 conditions per place. [2024-10-24 15:39:30,471 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 17 selfloop transitions, 3 changer transitions 1/154 dead transitions. [2024-10-24 15:39:30,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 154 transitions, 438 flow [2024-10-24 15:39:30,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2024-10-24 15:39:30,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9232613908872902 [2024-10-24 15:39:30,476 INFO L175 Difference]: Start difference. First operand has 143 places, 148 transitions, 384 flow. Second operand 3 states and 385 transitions. [2024-10-24 15:39:30,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 154 transitions, 438 flow [2024-10-24 15:39:30,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 154 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:30,482 INFO L231 Difference]: Finished difference. Result has 145 places, 150 transitions, 392 flow [2024-10-24 15:39:30,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=145, PETRI_TRANSITIONS=150} [2024-10-24 15:39:30,483 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 7 predicate places. [2024-10-24 15:39:30,484 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 150 transitions, 392 flow [2024-10-24 15:39:30,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-10-24 15:39:30,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:30,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:39:30,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:39:30,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:30,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1655208226, now seen corresponding path program 1 times [2024-10-24 15:39:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:30,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470492322] [2024-10-24 15:39:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:30,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:30,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470492322] [2024-10-24 15:39:30,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470492322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:30,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:30,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477603334] [2024-10-24 15:39:30,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:30,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:30,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:30,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:30,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 139 [2024-10-24 15:39:30,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 150 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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-10-24 15:39:30,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:30,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 139 [2024-10-24 15:39:30,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:30,770 INFO L124 PetriNetUnfolderBase]: 175/1007 cut-off events. [2024-10-24 15:39:30,771 INFO L125 PetriNetUnfolderBase]: For 180/187 co-relation queries the response was YES. [2024-10-24 15:39:30,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1664 conditions, 1007 events. 175/1007 cut-off events. For 180/187 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6825 event pairs, 79 based on Foata normal form. 3/937 useless extension candidates. Maximal degree in co-relation 1535. Up to 303 conditions per place. [2024-10-24 15:39:30,778 INFO L140 encePairwiseOnDemand]: 132/139 looper letters, 30 selfloop transitions, 11 changer transitions 0/163 dead transitions. [2024-10-24 15:39:30,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 163 transitions, 514 flow [2024-10-24 15:39:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2024-10-24 15:39:30,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9112709832134293 [2024-10-24 15:39:30,781 INFO L175 Difference]: Start difference. First operand has 145 places, 150 transitions, 392 flow. Second operand 3 states and 380 transitions. [2024-10-24 15:39:30,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 163 transitions, 514 flow [2024-10-24 15:39:30,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 163 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:30,788 INFO L231 Difference]: Finished difference. Result has 147 places, 157 transitions, 474 flow [2024-10-24 15:39:30,788 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=147, PETRI_TRANSITIONS=157} [2024-10-24 15:39:30,789 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 9 predicate places. [2024-10-24 15:39:30,789 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 157 transitions, 474 flow [2024-10-24 15:39:30,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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-10-24 15:39:30,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:30,791 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:39:30,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:39:30,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:30,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:30,793 INFO L85 PathProgramCache]: Analyzing trace with hash -621916228, now seen corresponding path program 1 times [2024-10-24 15:39:30,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:30,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401302099] [2024-10-24 15:39:30,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:39:31,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:31,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401302099] [2024-10-24 15:39:31,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401302099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:31,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:31,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:39:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157314692] [2024-10-24 15:39:31,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:31,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:31,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:31,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:31,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 139 [2024-10-24 15:39:31,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 157 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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-10-24 15:39:31,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:31,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 139 [2024-10-24 15:39:31,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:31,098 INFO L124 PetriNetUnfolderBase]: 23/415 cut-off events. [2024-10-24 15:39:31,098 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-10-24 15:39:31,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 415 events. 23/415 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1858 event pairs, 7 based on Foata normal form. 6/402 useless extension candidates. Maximal degree in co-relation 496. Up to 44 conditions per place. [2024-10-24 15:39:31,100 INFO L140 encePairwiseOnDemand]: 130/139 looper letters, 6 selfloop transitions, 9 changer transitions 2/139 dead transitions. [2024-10-24 15:39:31,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 139 transitions, 376 flow [2024-10-24 15:39:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2024-10-24 15:39:31,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9424460431654677 [2024-10-24 15:39:31,102 INFO L175 Difference]: Start difference. First operand has 147 places, 157 transitions, 474 flow. Second operand 3 states and 393 transitions. [2024-10-24 15:39:31,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 139 transitions, 376 flow [2024-10-24 15:39:31,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 139 transitions, 342 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-10-24 15:39:31,108 INFO L231 Difference]: Finished difference. Result has 139 places, 136 transitions, 333 flow [2024-10-24 15:39:31,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=139, PETRI_TRANSITIONS=136} [2024-10-24 15:39:31,109 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 1 predicate places. [2024-10-24 15:39:31,109 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 136 transitions, 333 flow [2024-10-24 15:39:31,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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-10-24 15:39:31,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:31,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:39:31,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:39:31,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:31,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash 775757993, now seen corresponding path program 1 times [2024-10-24 15:39:31,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:31,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415859898] [2024-10-24 15:39:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:31,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:31,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415859898] [2024-10-24 15:39:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415859898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:31,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:31,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699606055] [2024-10-24 15:39:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:31,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:31,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:31,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:31,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:31,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 139 [2024-10-24 15:39:31,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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-10-24 15:39:31,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:31,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 139 [2024-10-24 15:39:31,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:31,289 INFO L124 PetriNetUnfolderBase]: 65/581 cut-off events. [2024-10-24 15:39:31,289 INFO L125 PetriNetUnfolderBase]: For 139/148 co-relation queries the response was YES. [2024-10-24 15:39:31,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 581 events. 65/581 cut-off events. For 139/148 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3231 event pairs, 31 based on Foata normal form. 1/562 useless extension candidates. Maximal degree in co-relation 866. Up to 137 conditions per place. [2024-10-24 15:39:31,292 INFO L140 encePairwiseOnDemand]: 134/139 looper letters, 23 selfloop transitions, 4 changer transitions 3/145 dead transitions. [2024-10-24 15:39:31,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 145 transitions, 429 flow [2024-10-24 15:39:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-10-24 15:39:31,294 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.920863309352518 [2024-10-24 15:39:31,294 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 333 flow. Second operand 3 states and 384 transitions. [2024-10-24 15:39:31,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 145 transitions, 429 flow [2024-10-24 15:39:31,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 145 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:39:31,298 INFO L231 Difference]: Finished difference. Result has 142 places, 136 transitions, 346 flow [2024-10-24 15:39:31,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=142, PETRI_TRANSITIONS=136} [2024-10-24 15:39:31,301 INFO L277 CegarLoopForPetriNet]: 138 programPoint places, 4 predicate places. [2024-10-24 15:39:31,301 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 136 transitions, 346 flow [2024-10-24 15:39:31,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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-10-24 15:39:31,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:31,302 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:31,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:39:31,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-24 15:39:31,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:31,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1469047710, now seen corresponding path program 1 times [2024-10-24 15:39:31,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:31,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563070916] [2024-10-24 15:39:31,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:31,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:31,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:39:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:31,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:39:31,393 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:39:31,394 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-10-24 15:39:31,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-10-24 15:39:31,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-10-24 15:39:31,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-10-24 15:39:31,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-10-24 15:39:31,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-10-24 15:39:31,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-10-24 15:39:31,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-10-24 15:39:31,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-10-24 15:39:31,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-10-24 15:39:31,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-10-24 15:39:31,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:39:31,398 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:31,401 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-24 15:39:31,401 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-24 15:39:31,423 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 15:39:31,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 171 transitions, 352 flow [2024-10-24 15:39:31,454 INFO L124 PetriNetUnfolderBase]: 10/263 cut-off events. [2024-10-24 15:39:31,455 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 15:39:31,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 263 events. 10/263 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 410 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 182. Up to 6 conditions per place. [2024-10-24 15:39:31,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 171 transitions, 352 flow [2024-10-24 15:39:31,458 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 171 transitions, 352 flow [2024-10-24 15:39:31,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:39:31,460 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;@72346583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:39:31,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-24 15:39:31,465 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:39:31,465 INFO L124 PetriNetUnfolderBase]: 2/65 cut-off events. [2024-10-24 15:39:31,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:39:31,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:31,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:31,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:31,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:31,466 INFO L85 PathProgramCache]: Analyzing trace with hash 602229658, now seen corresponding path program 1 times [2024-10-24 15:39:31,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:31,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136382089] [2024-10-24 15:39:31,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:31,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:31,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:31,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136382089] [2024-10-24 15:39:31,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136382089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:31,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:31,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:31,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554307800] [2024-10-24 15:39:31,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:31,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:31,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:31,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:31,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 171 [2024-10-24 15:39:31,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 171 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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-10-24 15:39:31,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:31,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 171 [2024-10-24 15:39:31,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:32,635 INFO L124 PetriNetUnfolderBase]: 2700/8640 cut-off events. [2024-10-24 15:39:32,636 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-10-24 15:39:32,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13093 conditions, 8640 events. 2700/8640 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 88711 event pairs, 968 based on Foata normal form. 85/7736 useless extension candidates. Maximal degree in co-relation 5927. Up to 2282 conditions per place. [2024-10-24 15:39:32,740 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 46 selfloop transitions, 11 changer transitions 1/194 dead transitions. [2024-10-24 15:39:32,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 194 transitions, 517 flow [2024-10-24 15:39:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2024-10-24 15:39:32,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9298245614035088 [2024-10-24 15:39:32,743 INFO L175 Difference]: Start difference. First operand has 172 places, 171 transitions, 352 flow. Second operand 3 states and 477 transitions. [2024-10-24 15:39:32,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 194 transitions, 517 flow [2024-10-24 15:39:32,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 194 transitions, 517 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:39:32,747 INFO L231 Difference]: Finished difference. Result has 176 places, 178 transitions, 440 flow [2024-10-24 15:39:32,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=176, PETRI_TRANSITIONS=178} [2024-10-24 15:39:32,748 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 4 predicate places. [2024-10-24 15:39:32,749 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 178 transitions, 440 flow [2024-10-24 15:39:32,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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-10-24 15:39:32,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:32,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:32,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:39:32,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:32,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1555054066, now seen corresponding path program 1 times [2024-10-24 15:39:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:32,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918989053] [2024-10-24 15:39:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:32,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:32,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918989053] [2024-10-24 15:39:32,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918989053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:32,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:32,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:32,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944734425] [2024-10-24 15:39:32,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:32,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:32,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:32,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:32,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:32,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 171 [2024-10-24 15:39:32,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 178 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:32,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:32,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 171 [2024-10-24 15:39:32,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:34,272 INFO L124 PetriNetUnfolderBase]: 2944/10688 cut-off events. [2024-10-24 15:39:34,273 INFO L125 PetriNetUnfolderBase]: For 3033/3141 co-relation queries the response was YES. [2024-10-24 15:39:34,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18557 conditions, 10688 events. 2944/10688 cut-off events. For 3033/3141 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 119404 event pairs, 1867 based on Foata normal form. 56/9673 useless extension candidates. Maximal degree in co-relation 16666. Up to 4168 conditions per place. [2024-10-24 15:39:34,365 INFO L140 encePairwiseOnDemand]: 163/171 looper letters, 42 selfloop transitions, 12 changer transitions 0/196 dead transitions. [2024-10-24 15:39:34,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 196 transitions, 608 flow [2024-10-24 15:39:34,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2024-10-24 15:39:34,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.898635477582846 [2024-10-24 15:39:34,368 INFO L175 Difference]: Start difference. First operand has 176 places, 178 transitions, 440 flow. Second operand 3 states and 461 transitions. [2024-10-24 15:39:34,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 196 transitions, 608 flow [2024-10-24 15:39:34,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 196 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:34,380 INFO L231 Difference]: Finished difference. Result has 177 places, 188 transitions, 524 flow [2024-10-24 15:39:34,380 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=177, PETRI_TRANSITIONS=188} [2024-10-24 15:39:34,381 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 5 predicate places. [2024-10-24 15:39:34,381 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 188 transitions, 524 flow [2024-10-24 15:39:34,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:39:34,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:34,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:34,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:39:34,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:34,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:34,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1421391307, now seen corresponding path program 1 times [2024-10-24 15:39:34,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:34,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442138733] [2024-10-24 15:39:34,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:34,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:34,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:34,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442138733] [2024-10-24 15:39:34,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442138733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:34,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:34,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:34,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231921362] [2024-10-24 15:39:34,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:34,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:34,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:34,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:34,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:34,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 171 [2024-10-24 15:39:34,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 188 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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-10-24 15:39:34,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:34,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 171 [2024-10-24 15:39:34,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:35,679 INFO L124 PetriNetUnfolderBase]: 2291/10252 cut-off events. [2024-10-24 15:39:35,679 INFO L125 PetriNetUnfolderBase]: For 1028/1092 co-relation queries the response was YES. [2024-10-24 15:39:35,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16000 conditions, 10252 events. 2291/10252 cut-off events. For 1028/1092 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 119625 event pairs, 1380 based on Foata normal form. 4/9236 useless extension candidates. Maximal degree in co-relation 14478. Up to 2487 conditions per place. [2024-10-24 15:39:35,754 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 28 selfloop transitions, 4 changer transitions 0/199 dead transitions. [2024-10-24 15:39:35,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 199 transitions, 610 flow [2024-10-24 15:39:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-10-24 15:39:35,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-10-24 15:39:35,757 INFO L175 Difference]: Start difference. First operand has 177 places, 188 transitions, 524 flow. Second operand 3 states and 474 transitions. [2024-10-24 15:39:35,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 199 transitions, 610 flow [2024-10-24 15:39:35,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 199 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:35,767 INFO L231 Difference]: Finished difference. Result has 179 places, 191 transitions, 530 flow [2024-10-24 15:39:35,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=179, PETRI_TRANSITIONS=191} [2024-10-24 15:39:35,768 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 7 predicate places. [2024-10-24 15:39:35,768 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 191 transitions, 530 flow [2024-10-24 15:39:35,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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-10-24 15:39:35,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:35,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:39:35,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:39:35,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:35,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:35,770 INFO L85 PathProgramCache]: Analyzing trace with hash 938483404, now seen corresponding path program 1 times [2024-10-24 15:39:35,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:35,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504404674] [2024-10-24 15:39:35,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:35,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:35,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504404674] [2024-10-24 15:39:35,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504404674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:35,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:35,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:35,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135728338] [2024-10-24 15:39:35,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:35,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:35,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:35,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:35,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:35,860 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2024-10-24 15:39:35,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 191 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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-10-24 15:39:35,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:35,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2024-10-24 15:39:35,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:36,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][156], [171#true, Black: 175#true, 147#L692-2true, 185#true, 90#L712-1true, Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 190#true, 91#L692-7true, 173#true, Black: 187#(= |#race~data~0| 0)]) [2024-10-24 15:39:36,529 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-10-24 15:39:36,529 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-24 15:39:36,529 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-24 15:39:36,529 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-24 15:39:36,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [171#true, Black: 175#true, 147#L692-2true, 185#true, 99#L694true, 90#L712-1true, Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 190#true, 173#true, Black: 187#(= |#race~data~0| 0)]) [2024-10-24 15:39:36,834 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2024-10-24 15:39:36,834 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-24 15:39:36,834 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-24 15:39:36,834 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-24 15:39:36,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [171#true, 147#L692-2true, Black: 175#true, 185#true, 90#L712-1true, 145#L694-3true, Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 190#true, 173#true, Black: 187#(= |#race~data~0| 0)]) [2024-10-24 15:39:36,875 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-24 15:39:36,875 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-24 15:39:36,876 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-24 15:39:36,876 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-24 15:39:36,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [113#L695-3true, 171#true, 147#L692-2true, Black: 175#true, 185#true, 90#L712-1true, Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 190#true, 173#true, Black: 187#(= |#race~data~0| 0)]) [2024-10-24 15:39:36,955 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2024-10-24 15:39:36,955 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-24 15:39:36,956 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-24 15:39:36,956 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-24 15:39:37,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][77], [171#true, Black: 175#true, 147#L692-2true, 185#true, 90#L712-1true, Black: 182#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 190#true, 169#L697-3true, 173#true, Black: 187#(= |#race~data~0| 0)]) [2024-10-24 15:39:37,326 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-10-24 15:39:37,326 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-24 15:39:37,326 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-24 15:39:37,326 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-24 15:39:37,559 INFO L124 PetriNetUnfolderBase]: 4357/14773 cut-off events. [2024-10-24 15:39:37,559 INFO L125 PetriNetUnfolderBase]: For 5373/5805 co-relation queries the response was YES. [2024-10-24 15:39:37,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27116 conditions, 14773 events. 4357/14773 cut-off events. For 5373/5805 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 169396 event pairs, 2217 based on Foata normal form. 111/13264 useless extension candidates. Maximal degree in co-relation 24990. Up to 5572 conditions per place. [2024-10-24 15:39:37,652 INFO L140 encePairwiseOnDemand]: 162/171 looper letters, 49 selfloop transitions, 19 changer transitions 0/217 dead transitions. [2024-10-24 15:39:37,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 217 transitions, 767 flow [2024-10-24 15:39:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2024-10-24 15:39:37,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9142300194931774 [2024-10-24 15:39:37,654 INFO L175 Difference]: Start difference. First operand has 179 places, 191 transitions, 530 flow. Second operand 3 states and 469 transitions. [2024-10-24 15:39:37,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 217 transitions, 767 flow [2024-10-24 15:39:37,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 217 transitions, 759 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:37,668 INFO L231 Difference]: Finished difference. Result has 181 places, 206 transitions, 704 flow [2024-10-24 15:39:37,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=181, PETRI_TRANSITIONS=206} [2024-10-24 15:39:37,669 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2024-10-24 15:39:37,669 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 206 transitions, 704 flow [2024-10-24 15:39:37,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 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-10-24 15:39:37,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:37,670 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:39:37,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 15:39:37,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:37,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1982619994, now seen corresponding path program 1 times [2024-10-24 15:39:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:37,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772411623] [2024-10-24 15:39:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:37,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:39:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772411623] [2024-10-24 15:39:37,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772411623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:37,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:37,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:39:37,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441667551] [2024-10-24 15:39:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:37,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:37,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:37,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:37,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:37,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2024-10-24 15:39:37,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 206 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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-10-24 15:39:37,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:37,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2024-10-24 15:39:37,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:38,296 INFO L124 PetriNetUnfolderBase]: 453/3308 cut-off events. [2024-10-24 15:39:38,296 INFO L125 PetriNetUnfolderBase]: For 776/819 co-relation queries the response was YES. [2024-10-24 15:39:38,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5355 conditions, 3308 events. 453/3308 cut-off events. For 776/819 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 31964 event pairs, 171 based on Foata normal form. 69/3140 useless extension candidates. Maximal degree in co-relation 4698. Up to 484 conditions per place. [2024-10-24 15:39:38,316 INFO L140 encePairwiseOnDemand]: 159/171 looper letters, 15 selfloop transitions, 12 changer transitions 0/206 dead transitions. [2024-10-24 15:39:38,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 206 transitions, 693 flow [2024-10-24 15:39:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2024-10-24 15:39:38,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9454191033138402 [2024-10-24 15:39:38,318 INFO L175 Difference]: Start difference. First operand has 181 places, 206 transitions, 704 flow. Second operand 3 states and 485 transitions. [2024-10-24 15:39:38,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 206 transitions, 693 flow [2024-10-24 15:39:38,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 206 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:38,326 INFO L231 Difference]: Finished difference. Result has 182 places, 203 transitions, 656 flow [2024-10-24 15:39:38,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=182, PETRI_TRANSITIONS=203} [2024-10-24 15:39:38,327 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 10 predicate places. [2024-10-24 15:39:38,327 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 203 transitions, 656 flow [2024-10-24 15:39:38,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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-10-24 15:39:38,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:38,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:39:38,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 15:39:38,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:38,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash -584945773, now seen corresponding path program 1 times [2024-10-24 15:39:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073885031] [2024-10-24 15:39:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:39:38,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:38,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073885031] [2024-10-24 15:39:38,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073885031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:38,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:38,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:38,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562851119] [2024-10-24 15:39:38,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:38,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:38,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:38,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:38,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:38,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 171 [2024-10-24 15:39:38,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 203 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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-10-24 15:39:38,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:38,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 171 [2024-10-24 15:39:38,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:39,001 INFO L124 PetriNetUnfolderBase]: 1326/5900 cut-off events. [2024-10-24 15:39:39,002 INFO L125 PetriNetUnfolderBase]: For 2522/2706 co-relation queries the response was YES. [2024-10-24 15:39:39,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11870 conditions, 5900 events. 1326/5900 cut-off events. For 2522/2706 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 60856 event pairs, 633 based on Foata normal form. 8/5517 useless extension candidates. Maximal degree in co-relation 10722. Up to 1800 conditions per place. [2024-10-24 15:39:39,044 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 45 selfloop transitions, 7 changer transitions 0/223 dead transitions. [2024-10-24 15:39:39,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 223 transitions, 846 flow [2024-10-24 15:39:39,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2024-10-24 15:39:39,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2024-10-24 15:39:39,046 INFO L175 Difference]: Start difference. First operand has 182 places, 203 transitions, 656 flow. Second operand 3 states and 474 transitions. [2024-10-24 15:39:39,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 223 transitions, 846 flow [2024-10-24 15:39:39,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 223 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:39:39,055 INFO L231 Difference]: Finished difference. Result has 185 places, 208 transitions, 700 flow [2024-10-24 15:39:39,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=185, PETRI_TRANSITIONS=208} [2024-10-24 15:39:39,057 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 13 predicate places. [2024-10-24 15:39:39,057 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 208 transitions, 700 flow [2024-10-24 15:39:39,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 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-10-24 15:39:39,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:39,058 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:39:39,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 15:39:39,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:39,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:39,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1559606249, now seen corresponding path program 1 times [2024-10-24 15:39:39,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:39,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360060940] [2024-10-24 15:39:39,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:39,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:39:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 15:39:39,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:39:39,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360060940] [2024-10-24 15:39:39,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360060940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:39:39,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:39:39,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:39:39,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501646584] [2024-10-24 15:39:39,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:39:39,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:39:39,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:39:39,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:39:39,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:39:39,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2024-10-24 15:39:39,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 208 transitions, 700 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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-10-24 15:39:39,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:39:39,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2024-10-24 15:39:39,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:39:39,597 INFO L124 PetriNetUnfolderBase]: 820/4470 cut-off events. [2024-10-24 15:39:39,598 INFO L125 PetriNetUnfolderBase]: For 2669/3043 co-relation queries the response was YES. [2024-10-24 15:39:39,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9161 conditions, 4470 events. 820/4470 cut-off events. For 2669/3043 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 45885 event pairs, 395 based on Foata normal form. 8/4202 useless extension candidates. Maximal degree in co-relation 8261. Up to 1381 conditions per place. [2024-10-24 15:39:39,624 INFO L140 encePairwiseOnDemand]: 164/171 looper letters, 56 selfloop transitions, 11 changer transitions 0/223 dead transitions. [2024-10-24 15:39:39,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 223 transitions, 902 flow [2024-10-24 15:39:39,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:39:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:39:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2024-10-24 15:39:39,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9044834307992202 [2024-10-24 15:39:39,626 INFO L175 Difference]: Start difference. First operand has 185 places, 208 transitions, 700 flow. Second operand 3 states and 464 transitions. [2024-10-24 15:39:39,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 223 transitions, 902 flow [2024-10-24 15:39:39,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 223 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:39:39,635 INFO L231 Difference]: Finished difference. Result has 187 places, 215 transitions, 784 flow [2024-10-24 15:39:39,636 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=187, PETRI_TRANSITIONS=215} [2024-10-24 15:39:39,636 INFO L277 CegarLoopForPetriNet]: 172 programPoint places, 15 predicate places. [2024-10-24 15:39:39,636 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 215 transitions, 784 flow [2024-10-24 15:39:39,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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-10-24 15:39:39,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:39:39,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:39:39,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 15:39:39,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-24 15:39:39,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:39:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash 485472773, now seen corresponding path program 1 times [2024-10-24 15:39:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:39:39,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691262557] [2024-10-24 15:39:39,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:39:39,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:39:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:39,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 15:39:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 15:39:39,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 15:39:39,680 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 15:39:39,680 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2024-10-24 15:39:39,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-10-24 15:39:39,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-10-24 15:39:39,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-10-24 15:39:39,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 14 remaining) [2024-10-24 15:39:39,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-10-24 15:39:39,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-10-24 15:39:39,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-10-24 15:39:39,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-10-24 15:39:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-10-24 15:39:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-10-24 15:39:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-10-24 15:39:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-10-24 15:39:39,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-10-24 15:39:39,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 15:39:39,683 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:39:39,784 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-10-24 15:39:39,788 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-10-24 15:39:39,792 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-24 15:39:39,802 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-10-24 15:39:39,803 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 15:39:39,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:39:39 BasicIcfg [2024-10-24 15:39:39,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 15:39:39,810 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 15:39:39,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 15:39:39,810 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 15:39:39,811 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:39:28" (3/4) ... [2024-10-24 15:39:39,812 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 15:39:39,813 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 15:39:39,814 INFO L158 Benchmark]: Toolchain (without parser) took 12200.88ms. Allocated memory was 178.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 146.9MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 649.2MB. Max. memory is 16.1GB. [2024-10-24 15:39:39,814 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:39:39,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.90ms. Allocated memory is still 178.3MB. Free memory was 146.7MB in the beginning and 128.2MB in the end (delta: 18.5MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-10-24 15:39:39,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.55ms. Allocated memory is still 178.3MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:39:39,817 INFO L158 Benchmark]: Boogie Preprocessor took 38.23ms. Allocated memory is still 178.3MB. Free memory was 126.1MB in the beginning and 124.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:39:39,817 INFO L158 Benchmark]: RCFGBuilder took 577.14ms. Allocated memory is still 178.3MB. Free memory was 124.8MB in the beginning and 105.1MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 15:39:39,817 INFO L158 Benchmark]: TraceAbstraction took 11033.00ms. Allocated memory was 178.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 104.3MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 607.1MB. Max. memory is 16.1GB. [2024-10-24 15:39:39,817 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 3.2GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:39:39,819 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.19ms. Allocated memory is still 130.0MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.90ms. Allocated memory is still 178.3MB. Free memory was 146.7MB in the beginning and 128.2MB in the end (delta: 18.5MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.55ms. Allocated memory is still 178.3MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.23ms. Allocated memory is still 178.3MB. Free memory was 126.1MB in the beginning and 124.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 577.14ms. Allocated memory is still 178.3MB. Free memory was 124.8MB in the beginning and 105.1MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11033.00ms. Allocated memory was 178.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 104.3MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 607.1MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 3.2GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 715]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = 0; VAL [threads_alive=0] [L686] 0 pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [threads_alive=0, threads_alive_mutex={1:0}] [L687] 0 pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; VAL [threads_alive=0, threads_alive_mutex={1:0}] [L688] 0 int data = 0; VAL [data=0, threads_alive=0, threads_alive_mutex={1:0}] [L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L701] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L702] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L702] RET 0 assume_abort_if_not(threads_total >= 0) [L703] 0 int i = 0; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L703] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L705] 0 threads_alive++ VAL [data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1] [L707] 0 pthread_t tid; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1] [L708] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1, tid=-1] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L696] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L703] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L703] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L712] COND FALSE 0 !(\read(threads_alive)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L715] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L696] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L715] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] Now there is a data race on ~data~0 between C: data = __VERIFIER_nondet_int() [696] and C: return data; [715] - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: 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. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 168 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.5s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 272 IncrementalHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 57 mSDtfsCounter, 272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=474occurred in iteration=4, InterpolantAutomatonStates: 18, 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.6s InterpolantComputationTime, 561 NumberOfCodeBlocks, 561 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 9/9 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, 200 locations, 14 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: 8.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 460 IncrementalHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 27 mSDtfsCounter, 460 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=784occurred in iteration=7, InterpolantAutomatonStates: 21, 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.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 684 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 28/28 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-10-24 15:39:39,852 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