./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.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 10776deb9ece8603196e8eecaf972964a6cae8e272af6ac2269e1894470ceda6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:50:25,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:50:25,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:50:25,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:50:25,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:50:25,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:50:25,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:50:25,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:50:25,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:50:25,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:50:25,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:50:25,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:50:25,663 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:50:25,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:50:25,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:50:25,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:50:25,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:50:25,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:50:25,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:50:25,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:50:25,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:50:25,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:50:25,666 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:50:25,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:50:25,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:50:25,667 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:50:25,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:50:25,667 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:50:25,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:50:25,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:50:25,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:50:25,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:50:25,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:50:25,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:50:25,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:50:25,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:50:25,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:50:25,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:50:25,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:50:25,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:50:25,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:50:25,670 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 -> 10776deb9ece8603196e8eecaf972964a6cae8e272af6ac2269e1894470ceda6 [2024-11-09 06:50:25,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:50:25,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:50:25,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:50:25,884 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:50:25,884 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:50:25,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i [2024-11-09 06:50:27,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:50:27,362 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:50:27,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_24-malloc_races.i [2024-11-09 06:50:27,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4202af9/0e32b1995ad9466db14ce6e5129790bf/FLAG944164091 [2024-11-09 06:50:27,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4202af9/0e32b1995ad9466db14ce6e5129790bf [2024-11-09 06:50:27,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:50:27,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:50:27,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:50:27,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:50:27,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:50:27,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:27,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68e4b9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27, skipping insertion in model container [2024-11-09 06:50:27,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:27,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:50:27,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:50:27,866 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:50:27,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:50:27,977 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:50:27,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27 WrapperNode [2024-11-09 06:50:27,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:50:27,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:50:27,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:50:27,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:50:27,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:28,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:28,030 INFO L138 Inliner]: procedures = 365, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2024-11-09 06:50:28,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:50:28,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:50:28,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:50:28,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:50:28,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:28,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:28,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:28,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:28,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:28,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:28,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:28,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:28,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:50:28,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:50:28,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:50:28,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:50:28,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (1/1) ... [2024-11-09 06:50:28,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:50:28,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:50:28,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:50:28,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:50:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:50:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:50:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:50:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:50:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:50:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:50:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:50:28,123 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:50:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:50:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:50:28,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:50:28,124 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:50:28,259 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:50:28,260 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:50:28,442 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:50:28,443 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:50:28,469 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:50:28,470 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:50:28,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:50:28 BoogieIcfgContainer [2024-11-09 06:50:28,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:50:28,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:50:28,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:50:28,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:50:28,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:50:27" (1/3) ... [2024-11-09 06:50:28,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a40eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:50:28, skipping insertion in model container [2024-11-09 06:50:28,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:27" (2/3) ... [2024-11-09 06:50:28,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a40eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:50:28, skipping insertion in model container [2024-11-09 06:50:28,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:50:28" (3/3) ... [2024-11-09 06:50:28,477 INFO L112 eAbstractionObserver]: Analyzing ICFG 02-base_24-malloc_races.i [2024-11-09 06:50:28,490 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:50:28,491 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-09 06:50:28,491 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:50:28,543 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:50:28,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 102 transitions, 208 flow [2024-11-09 06:50:28,615 INFO L124 PetriNetUnfolderBase]: 0/101 cut-off events. [2024-11-09 06:50:28,617 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:28,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 101 events. 0/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-09 06:50:28,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 102 transitions, 208 flow [2024-11-09 06:50:28,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 101 transitions, 205 flow [2024-11-09 06:50:28,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:50:28,637 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;@725e05cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:50:28,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 06:50:28,643 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:50:28,643 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-11-09 06:50:28,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:28,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:28,643 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:28,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:28,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1567190117, now seen corresponding path program 1 times [2024-11-09 06:50:28,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:28,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945334025] [2024-11-09 06:50:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:28,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:28,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:28,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945334025] [2024-11-09 06:50:28,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945334025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:28,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:28,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:28,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301573775] [2024-11-09 06:50:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:28,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:28,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:28,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:28,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:28,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2024-11-09 06:50:28,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 101 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:28,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:28,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2024-11-09 06:50:28,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:29,000 INFO L124 PetriNetUnfolderBase]: 12/232 cut-off events. [2024-11-09 06:50:29,000 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:50:29,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 232 events. 12/232 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 658 event pairs, 12 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 230. Up to 36 conditions per place. [2024-11-09 06:50:29,004 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 11 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2024-11-09 06:50:29,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 100 transitions, 229 flow [2024-11-09 06:50:29,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-11-09 06:50:29,017 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-11-09 06:50:29,018 INFO L175 Difference]: Start difference. First operand has 105 places, 101 transitions, 205 flow. Second operand 3 states and 278 transitions. [2024-11-09 06:50:29,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 100 transitions, 229 flow [2024-11-09 06:50:29,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 100 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:50:29,027 INFO L231 Difference]: Finished difference. Result has 105 places, 100 transitions, 206 flow [2024-11-09 06:50:29,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=105, PETRI_TRANSITIONS=100} [2024-11-09 06:50:29,033 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 0 predicate places. [2024-11-09 06:50:29,035 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 100 transitions, 206 flow [2024-11-09 06:50:29,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:29,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:29,035 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] [2024-11-09 06:50:29,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:50:29,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:29,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash 166918694, now seen corresponding path program 1 times [2024-11-09 06:50:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:29,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495490293] [2024-11-09 06:50:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:29,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:29,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:29,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495490293] [2024-11-09 06:50:29,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495490293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:29,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:29,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:29,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118581128] [2024-11-09 06:50:29,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:29,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:29,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:29,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:29,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:29,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 102 [2024-11-09 06:50:29,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:29,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:29,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 102 [2024-11-09 06:50:29,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:29,169 INFO L124 PetriNetUnfolderBase]: 12/231 cut-off events. [2024-11-09 06:50:29,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:29,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 231 events. 12/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 702 event pairs, 12 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 248. Up to 36 conditions per place. [2024-11-09 06:50:29,171 INFO L140 encePairwiseOnDemand]: 99/102 looper letters, 11 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2024-11-09 06:50:29,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 230 flow [2024-11-09 06:50:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2024-11-09 06:50:29,173 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084967320261438 [2024-11-09 06:50:29,173 INFO L175 Difference]: Start difference. First operand has 105 places, 100 transitions, 206 flow. Second operand 3 states and 278 transitions. [2024-11-09 06:50:29,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 230 flow [2024-11-09 06:50:29,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:29,175 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 204 flow [2024-11-09 06:50:29,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-11-09 06:50:29,176 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, -1 predicate places. [2024-11-09 06:50:29,176 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 204 flow [2024-11-09 06:50:29,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:29,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:29,177 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] [2024-11-09 06:50:29,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:50:29,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:29,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1560174162, now seen corresponding path program 1 times [2024-11-09 06:50:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:29,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757933906] [2024-11-09 06:50:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:29,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:29,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757933906] [2024-11-09 06:50:29,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757933906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:29,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:29,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:29,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21978825] [2024-11-09 06:50:29,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:29,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:29,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:29,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:29,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:29,266 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 102 [2024-11-09 06:50:29,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:29,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:29,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 102 [2024-11-09 06:50:29,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:29,307 INFO L124 PetriNetUnfolderBase]: 16/262 cut-off events. [2024-11-09 06:50:29,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:29,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 262 events. 16/262 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 907 event pairs, 7 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 277. Up to 36 conditions per place. [2024-11-09 06:50:29,312 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 12 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-11-09 06:50:29,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 236 flow [2024-11-09 06:50:29,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2024-11-09 06:50:29,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.934640522875817 [2024-11-09 06:50:29,314 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 204 flow. Second operand 3 states and 286 transitions. [2024-11-09 06:50:29,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 236 flow [2024-11-09 06:50:29,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 101 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:29,316 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 210 flow [2024-11-09 06:50:29,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2024-11-09 06:50:29,318 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, -2 predicate places. [2024-11-09 06:50:29,318 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 210 flow [2024-11-09 06:50:29,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:29,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:29,319 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] [2024-11-09 06:50:29,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:50:29,319 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:29,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash 228185078, now seen corresponding path program 1 times [2024-11-09 06:50:29,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:29,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217147618] [2024-11-09 06:50:29,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:29,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:29,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:29,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217147618] [2024-11-09 06:50:29,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217147618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:29,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:29,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:29,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034427186] [2024-11-09 06:50:29,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:29,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:50:29,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:29,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:50:29,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:29,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 102 [2024-11-09 06:50:29,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:29,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:29,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 102 [2024-11-09 06:50:29,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:29,997 INFO L124 PetriNetUnfolderBase]: 231/883 cut-off events. [2024-11-09 06:50:29,998 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:29,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 883 events. 231/883 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5174 event pairs, 96 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 1360. Up to 348 conditions per place. [2024-11-09 06:50:30,007 INFO L140 encePairwiseOnDemand]: 86/102 looper letters, 51 selfloop transitions, 41 changer transitions 0/163 dead transitions. [2024-11-09 06:50:30,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 163 transitions, 522 flow [2024-11-09 06:50:30,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:50:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:50:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions. [2024-11-09 06:50:30,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8774509803921569 [2024-11-09 06:50:30,010 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 210 flow. Second operand 6 states and 537 transitions. [2024-11-09 06:50:30,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 163 transitions, 522 flow [2024-11-09 06:50:30,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 163 transitions, 522 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:50:30,015 INFO L231 Difference]: Finished difference. Result has 112 places, 141 transitions, 468 flow [2024-11-09 06:50:30,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=112, PETRI_TRANSITIONS=141} [2024-11-09 06:50:30,015 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 7 predicate places. [2024-11-09 06:50:30,016 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 141 transitions, 468 flow [2024-11-09 06:50:30,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.66666666666667) internal successors, (454), 6 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:30,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:30,017 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] [2024-11-09 06:50:30,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:50:30,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:30,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:30,019 INFO L85 PathProgramCache]: Analyzing trace with hash 712846405, now seen corresponding path program 1 times [2024-11-09 06:50:30,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:30,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608462042] [2024-11-09 06:50:30,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:30,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:30,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:30,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608462042] [2024-11-09 06:50:30,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608462042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:30,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:30,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740831493] [2024-11-09 06:50:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:30,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:50:30,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:30,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:50:30,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:30,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2024-11-09 06:50:30,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 141 transitions, 468 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:30,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:30,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2024-11-09 06:50:30,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:30,543 INFO L124 PetriNetUnfolderBase]: 285/1200 cut-off events. [2024-11-09 06:50:30,543 INFO L125 PetriNetUnfolderBase]: For 367/441 co-relation queries the response was YES. [2024-11-09 06:50:30,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2467 conditions, 1200 events. 285/1200 cut-off events. For 367/441 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8271 event pairs, 29 based on Foata normal form. 31/1165 useless extension candidates. Maximal degree in co-relation 2422. Up to 272 conditions per place. [2024-11-09 06:50:30,549 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 71 selfloop transitions, 48 changer transitions 0/216 dead transitions. [2024-11-09 06:50:30,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 216 transitions, 970 flow [2024-11-09 06:50:30,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:50:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:50:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2024-11-09 06:50:30,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9264705882352942 [2024-11-09 06:50:30,552 INFO L175 Difference]: Start difference. First operand has 112 places, 141 transitions, 468 flow. Second operand 6 states and 567 transitions. [2024-11-09 06:50:30,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 216 transitions, 970 flow [2024-11-09 06:50:30,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 216 transitions, 970 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:50:30,557 INFO L231 Difference]: Finished difference. Result has 122 places, 187 transitions, 874 flow [2024-11-09 06:50:30,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=874, PETRI_PLACES=122, PETRI_TRANSITIONS=187} [2024-11-09 06:50:30,558 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 17 predicate places. [2024-11-09 06:50:30,558 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 187 transitions, 874 flow [2024-11-09 06:50:30,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:30,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:30,558 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] [2024-11-09 06:50:30,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:50:30,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:30,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:30,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1071308684, now seen corresponding path program 1 times [2024-11-09 06:50:30,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:30,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439208745] [2024-11-09 06:50:30,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:30,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:30,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:30,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439208745] [2024-11-09 06:50:30,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439208745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:30,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:30,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:30,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313969273] [2024-11-09 06:50:30,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:30,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:30,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:30,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:30,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 102 [2024-11-09 06:50:30,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 187 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:30,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:30,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 102 [2024-11-09 06:50:30,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:30,700 INFO L124 PetriNetUnfolderBase]: 231/1142 cut-off events. [2024-11-09 06:50:30,700 INFO L125 PetriNetUnfolderBase]: For 568/631 co-relation queries the response was YES. [2024-11-09 06:50:30,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 1142 events. 231/1142 cut-off events. For 568/631 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8031 event pairs, 24 based on Foata normal form. 14/1112 useless extension candidates. Maximal degree in co-relation 2406. Up to 215 conditions per place. [2024-11-09 06:50:30,706 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 13 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2024-11-09 06:50:30,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 190 transitions, 910 flow [2024-11-09 06:50:30,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2024-11-09 06:50:30,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2024-11-09 06:50:30,708 INFO L175 Difference]: Start difference. First operand has 122 places, 187 transitions, 874 flow. Second operand 3 states and 287 transitions. [2024-11-09 06:50:30,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 190 transitions, 910 flow [2024-11-09 06:50:30,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 190 transitions, 902 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-11-09 06:50:30,715 INFO L231 Difference]: Finished difference. Result has 123 places, 187 transitions, 876 flow [2024-11-09 06:50:30,715 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=123, PETRI_TRANSITIONS=187} [2024-11-09 06:50:30,716 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 18 predicate places. [2024-11-09 06:50:30,716 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 187 transitions, 876 flow [2024-11-09 06:50:30,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:30,716 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:30,717 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] [2024-11-09 06:50:30,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:50:30,717 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:30,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:30,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1425661799, now seen corresponding path program 1 times [2024-11-09 06:50:30,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:30,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002702852] [2024-11-09 06:50:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:30,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:30,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002702852] [2024-11-09 06:50:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002702852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:30,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:30,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:50:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885313124] [2024-11-09 06:50:30,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:30,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 102 [2024-11-09 06:50:30,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 187 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:30,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:30,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 102 [2024-11-09 06:50:30,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:30,803 INFO L124 PetriNetUnfolderBase]: 40/302 cut-off events. [2024-11-09 06:50:30,803 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-09 06:50:30,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 302 events. 40/302 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1117 event pairs, 4 based on Foata normal form. 2/292 useless extension candidates. Maximal degree in co-relation 523. Up to 68 conditions per place. [2024-11-09 06:50:30,804 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 2 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2024-11-09 06:50:30,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 422 flow [2024-11-09 06:50:30,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2024-11-09 06:50:30,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9673202614379085 [2024-11-09 06:50:30,806 INFO L175 Difference]: Start difference. First operand has 123 places, 187 transitions, 876 flow. Second operand 3 states and 296 transitions. [2024-11-09 06:50:30,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 422 flow [2024-11-09 06:50:30,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 120 transitions, 372 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-11-09 06:50:30,808 INFO L231 Difference]: Finished difference. Result has 116 places, 120 transitions, 368 flow [2024-11-09 06:50:30,809 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=116, PETRI_TRANSITIONS=120} [2024-11-09 06:50:30,809 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 11 predicate places. [2024-11-09 06:50:30,809 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 120 transitions, 368 flow [2024-11-09 06:50:30,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:30,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:30,810 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] [2024-11-09 06:50:30,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:50:30,810 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:30,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash 793310716, now seen corresponding path program 1 times [2024-11-09 06:50:30,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:30,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595318582] [2024-11-09 06:50:30,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:30,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:31,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:31,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595318582] [2024-11-09 06:50:31,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595318582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:31,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:31,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:31,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123136153] [2024-11-09 06:50:31,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:31,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:50:31,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:31,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:50:31,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:31,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 102 [2024-11-09 06:50:31,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 120 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:31,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:31,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 102 [2024-11-09 06:50:31,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:31,178 INFO L124 PetriNetUnfolderBase]: 142/645 cut-off events. [2024-11-09 06:50:31,178 INFO L125 PetriNetUnfolderBase]: For 114/129 co-relation queries the response was YES. [2024-11-09 06:50:31,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 645 events. 142/645 cut-off events. For 114/129 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3453 event pairs, 35 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 1226. Up to 231 conditions per place. [2024-11-09 06:50:31,181 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 59 selfloop transitions, 25 changer transitions 4/160 dead transitions. [2024-11-09 06:50:31,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 160 transitions, 656 flow [2024-11-09 06:50:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:50:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:50:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2024-11-09 06:50:31,182 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8382352941176471 [2024-11-09 06:50:31,183 INFO L175 Difference]: Start difference. First operand has 116 places, 120 transitions, 368 flow. Second operand 6 states and 513 transitions. [2024-11-09 06:50:31,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 160 transitions, 656 flow [2024-11-09 06:50:31,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 160 transitions, 652 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:50:31,185 INFO L231 Difference]: Finished difference. Result has 124 places, 145 transitions, 552 flow [2024-11-09 06:50:31,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=124, PETRI_TRANSITIONS=145} [2024-11-09 06:50:31,187 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 19 predicate places. [2024-11-09 06:50:31,187 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 145 transitions, 552 flow [2024-11-09 06:50:31,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:31,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:31,188 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] [2024-11-09 06:50:31,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:50:31,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:31,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:31,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1221870245, now seen corresponding path program 1 times [2024-11-09 06:50:31,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:31,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912827557] [2024-11-09 06:50:31,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:31,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:31,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912827557] [2024-11-09 06:50:31,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912827557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:31,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:31,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:31,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979823890] [2024-11-09 06:50:31,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:31,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:50:31,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:31,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:50:31,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:31,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2024-11-09 06:50:31,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 145 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:31,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:31,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2024-11-09 06:50:31,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:31,640 INFO L124 PetriNetUnfolderBase]: 204/839 cut-off events. [2024-11-09 06:50:31,640 INFO L125 PetriNetUnfolderBase]: For 456/476 co-relation queries the response was YES. [2024-11-09 06:50:31,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 839 events. 204/839 cut-off events. For 456/476 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4982 event pairs, 16 based on Foata normal form. 22/859 useless extension candidates. Maximal degree in co-relation 2122. Up to 239 conditions per place. [2024-11-09 06:50:31,645 INFO L140 encePairwiseOnDemand]: 87/102 looper letters, 65 selfloop transitions, 51 changer transitions 24/219 dead transitions. [2024-11-09 06:50:31,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 219 transitions, 1178 flow [2024-11-09 06:50:31,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:50:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:50:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 563 transitions. [2024-11-09 06:50:31,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199346405228758 [2024-11-09 06:50:31,647 INFO L175 Difference]: Start difference. First operand has 124 places, 145 transitions, 552 flow. Second operand 6 states and 563 transitions. [2024-11-09 06:50:31,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 219 transitions, 1178 flow [2024-11-09 06:50:31,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 219 transitions, 1164 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-09 06:50:31,653 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 922 flow [2024-11-09 06:50:31,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2024-11-09 06:50:31,654 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 28 predicate places. [2024-11-09 06:50:31,655 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 922 flow [2024-11-09 06:50:31,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:31,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:31,655 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] [2024-11-09 06:50:31,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:50:31,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:31,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1326670820, now seen corresponding path program 1 times [2024-11-09 06:50:31,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:31,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569427934] [2024-11-09 06:50:31,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:31,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:32,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:32,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569427934] [2024-11-09 06:50:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569427934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:32,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:32,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 06:50:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736463176] [2024-11-09 06:50:32,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:32,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:50:32,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:32,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:50:32,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:50:32,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 102 [2024-11-09 06:50:32,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 179 transitions, 922 flow. Second operand has 11 states, 11 states have (on average 68.27272727272727) internal successors, (751), 11 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:32,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:32,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 102 [2024-11-09 06:50:32,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:32,598 INFO L124 PetriNetUnfolderBase]: 220/863 cut-off events. [2024-11-09 06:50:32,598 INFO L125 PetriNetUnfolderBase]: For 1081/1108 co-relation queries the response was YES. [2024-11-09 06:50:32,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2700 conditions, 863 events. 220/863 cut-off events. For 1081/1108 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5346 event pairs, 46 based on Foata normal form. 12/857 useless extension candidates. Maximal degree in co-relation 2635. Up to 299 conditions per place. [2024-11-09 06:50:32,602 INFO L140 encePairwiseOnDemand]: 90/102 looper letters, 94 selfloop transitions, 31 changer transitions 4/205 dead transitions. [2024-11-09 06:50:32,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 205 transitions, 1408 flow [2024-11-09 06:50:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:50:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 06:50:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 848 transitions. [2024-11-09 06:50:32,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6928104575163399 [2024-11-09 06:50:32,605 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 922 flow. Second operand 12 states and 848 transitions. [2024-11-09 06:50:32,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 205 transitions, 1408 flow [2024-11-09 06:50:32,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 205 transitions, 1359 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-11-09 06:50:32,614 INFO L231 Difference]: Finished difference. Result has 139 places, 178 transitions, 931 flow [2024-11-09 06:50:32,615 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=931, PETRI_PLACES=139, PETRI_TRANSITIONS=178} [2024-11-09 06:50:32,616 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 34 predicate places. [2024-11-09 06:50:32,616 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 178 transitions, 931 flow [2024-11-09 06:50:32,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 68.27272727272727) internal successors, (751), 11 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:32,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:32,617 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] [2024-11-09 06:50:32,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:50:32,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:32,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash 680857159, now seen corresponding path program 1 times [2024-11-09 06:50:32,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:32,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744331637] [2024-11-09 06:50:32,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:32,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:32,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:32,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744331637] [2024-11-09 06:50:32,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744331637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:32,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:32,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 06:50:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206289301] [2024-11-09 06:50:32,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:32,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:50:32,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:50:32,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:50:33,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 102 [2024-11-09 06:50:33,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 178 transitions, 931 flow. Second operand has 11 states, 11 states have (on average 73.72727272727273) internal successors, (811), 11 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:33,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:33,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 102 [2024-11-09 06:50:33,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:33,656 INFO L124 PetriNetUnfolderBase]: 219/829 cut-off events. [2024-11-09 06:50:33,656 INFO L125 PetriNetUnfolderBase]: For 1108/1142 co-relation queries the response was YES. [2024-11-09 06:50:33,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2748 conditions, 829 events. 219/829 cut-off events. For 1108/1142 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5047 event pairs, 20 based on Foata normal form. 18/836 useless extension candidates. Maximal degree in co-relation 2679. Up to 177 conditions per place. [2024-11-09 06:50:33,660 INFO L140 encePairwiseOnDemand]: 85/102 looper letters, 95 selfloop transitions, 59 changer transitions 12/236 dead transitions. [2024-11-09 06:50:33,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 236 transitions, 1662 flow [2024-11-09 06:50:33,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:50:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 06:50:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 959 transitions. [2024-11-09 06:50:33,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7834967320261438 [2024-11-09 06:50:33,675 INFO L175 Difference]: Start difference. First operand has 139 places, 178 transitions, 931 flow. Second operand 12 states and 959 transitions. [2024-11-09 06:50:33,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 236 transitions, 1662 flow [2024-11-09 06:50:33,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 236 transitions, 1560 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-09 06:50:33,683 INFO L231 Difference]: Finished difference. Result has 144 places, 185 transitions, 1160 flow [2024-11-09 06:50:33,683 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1160, PETRI_PLACES=144, PETRI_TRANSITIONS=185} [2024-11-09 06:50:33,684 INFO L277 CegarLoopForPetriNet]: 105 programPoint places, 39 predicate places. [2024-11-09 06:50:33,685 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 185 transitions, 1160 flow [2024-11-09 06:50:33,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 73.72727272727273) internal successors, (811), 11 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:33,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:33,686 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] [2024-11-09 06:50:33,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:50:33,686 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:33,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:33,686 INFO L85 PathProgramCache]: Analyzing trace with hash 913595489, now seen corresponding path program 1 times [2024-11-09 06:50:33,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:33,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301890200] [2024-11-09 06:50:33,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:33,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:33,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:50:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:33,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:50:33,743 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:50:33,744 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-11-09 06:50:33,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-09 06:50:33,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-09 06:50:33,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-09 06:50:33,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-09 06:50:33,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-09 06:50:33,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2024-11-09 06:50:33,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-09 06:50:33,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-09 06:50:33,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-09 06:50:33,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-09 06:50:33,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-09 06:50:33,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-09 06:50:33,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-09 06:50:33,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-09 06:50:33,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:50:33,747 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:33,793 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:50:33,794 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:50:33,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:50:33 BasicIcfg [2024-11-09 06:50:33,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:50:33,798 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:50:33,798 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:50:33,798 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:50:33,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:50:28" (3/4) ... [2024-11-09 06:50:33,799 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 06:50:33,839 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:50:33,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:50:33,839 INFO L158 Benchmark]: Toolchain (without parser) took 6444.79ms. Allocated memory was 178.3MB in the beginning and 268.4MB in the end (delta: 90.2MB). Free memory was 145.1MB in the beginning and 199.7MB in the end (delta: -54.6MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-11-09 06:50:33,839 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:50:33,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.18ms. Allocated memory is still 178.3MB. Free memory was 145.1MB in the beginning and 103.3MB in the end (delta: 41.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-09 06:50:33,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.62ms. Allocated memory is still 178.3MB. Free memory was 103.3MB in the beginning and 100.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:50:33,840 INFO L158 Benchmark]: Boogie Preprocessor took 23.06ms. Allocated memory is still 178.3MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:50:33,840 INFO L158 Benchmark]: RCFGBuilder took 414.46ms. Allocated memory is still 178.3MB. Free memory was 99.0MB in the beginning and 81.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 06:50:33,841 INFO L158 Benchmark]: TraceAbstraction took 5325.31ms. Allocated memory was 178.3MB in the beginning and 268.4MB in the end (delta: 90.2MB). Free memory was 80.3MB in the beginning and 207.0MB in the end (delta: -126.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:50:33,841 INFO L158 Benchmark]: Witness Printer took 41.42ms. Allocated memory is still 268.4MB. Free memory was 207.0MB in the beginning and 199.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 06:50:33,842 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.15ms. Allocated memory is still 121.6MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.18ms. Allocated memory is still 178.3MB. Free memory was 145.1MB in the beginning and 103.3MB in the end (delta: 41.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.62ms. Allocated memory is still 178.3MB. Free memory was 103.3MB in the beginning and 100.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.06ms. Allocated memory is still 178.3MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 414.46ms. Allocated memory is still 178.3MB. Free memory was 99.0MB in the beginning and 81.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5325.31ms. Allocated memory was 178.3MB in the beginning and 268.4MB in the end (delta: 90.2MB). Free memory was 80.3MB in the beginning and 207.0MB in the end (delta: -126.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 41.42ms. Allocated memory is still 268.4MB. Free memory was 207.0MB in the beginning and 199.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1241]: Data race detected Data race detected The following path leads to a data race: [L1223] 0 int *x; VAL [x={0:0}] [L1224] 0 int *y; VAL [x={0:0}, y={0:0}] [L1225] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [m={1:0}, x={0:0}, y={0:0}] [L1234] 0 pthread_t id; VAL [m={1:0}, x={0:0}, y={0:0}] [L1235] 0 x = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={0:0}] [L1236] 0 y = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={-3:0}] [L1237] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1239] EXPR 0 *x VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1239] EXPR 0 \read(*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1239] 0 printf("%d\n",*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 *y VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1228] EXPR 1 *x VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1228] 1 *x = 3 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1229] EXPR 1 *y VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1229] 1 *y = 8 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 *y VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1241] EXPR 0 \read(*y) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L1229] 1 *y = 8 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1241] 0 printf("%d\n",*y) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *x = 3 [1228] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: *y = 8 [1229] * C: *x = 3 [1228] * C: y = malloc(sizeof(int)) [1236] * C: x = malloc(sizeof(int)) [1235] and C: printf("%d\n",*y) [1241] - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1236]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: 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: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: 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, 136 locations, 15 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: 5.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 852 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 580 mSDsluCounter, 395 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2902 IncrementalHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 90 mSDtfsCounter, 2902 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1160occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 1637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 06:50:33,870 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