./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.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_25-malloc_race_cp.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 1bf1a57452cb04c4e0acc7059a368e9894233cf719b7dca68f11bd8477a0c6ed --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:50:27,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:50:27,311 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:27,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:50:27,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:50:27,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:50:27,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:50:27,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:50:27,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:50:27,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:50:27,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:50:27,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:50:27,348 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:50:27,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:50:27,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:50:27,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:50:27,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:50:27,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:50:27,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:50:27,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:50:27,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:50:27,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:50:27,352 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:50:27,352 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:50:27,352 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:50:27,352 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:50:27,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:50:27,354 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:50:27,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:50:27,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:50:27,354 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:50:27,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:50:27,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:50:27,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:50:27,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:50:27,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:50:27,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:50:27,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:50:27,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:50:27,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:50:27,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:50:27,358 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 -> 1bf1a57452cb04c4e0acc7059a368e9894233cf719b7dca68f11bd8477a0c6ed [2024-11-09 06:50:27,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:50:27,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:50:27,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:50:27,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:50:27,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:50:27,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i [2024-11-09 06:50:29,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:50:29,384 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:50:29,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i [2024-11-09 06:50:29,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d19bd80c/5c06626aeac141c9899235ecbfe37359/FLAGa92f4521d [2024-11-09 06:50:29,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d19bd80c/5c06626aeac141c9899235ecbfe37359 [2024-11-09 06:50:29,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:50:29,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:50:29,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:50:29,676 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:50:29,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:50:29,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:50:29" (1/1) ... [2024-11-09 06:50:29,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453733e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:29, skipping insertion in model container [2024-11-09 06:50:29,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:50:29" (1/1) ... [2024-11-09 06:50:29,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:50:30,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:50:30,217 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:50:30,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:50:30,336 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:50:30,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:30 WrapperNode [2024-11-09 06:50:30,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:50:30,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:50:30,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:50:30,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:50:30,347 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:30" (1/1) ... [2024-11-09 06:50:30,369 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:30" (1/1) ... [2024-11-09 06:50:30,386 INFO L138 Inliner]: procedures = 365, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2024-11-09 06:50:30,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:50:30,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:50:30,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:50:30,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:50:30,394 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:30" (1/1) ... [2024-11-09 06:50:30,394 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:30" (1/1) ... [2024-11-09 06:50:30,397 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:30" (1/1) ... [2024-11-09 06:50:30,397 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:30" (1/1) ... [2024-11-09 06:50:30,403 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:30" (1/1) ... [2024-11-09 06:50:30,404 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:30" (1/1) ... [2024-11-09 06:50:30,405 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:30" (1/1) ... [2024-11-09 06:50:30,406 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:30" (1/1) ... [2024-11-09 06:50:30,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:50:30,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:50:30,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:50:30,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:50:30,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:30" (1/1) ... [2024-11-09 06:50:30,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:50:30,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:50:30,444 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:30,456 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:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:50:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:50:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:50:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:50:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:50:30,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:50:30,493 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:50:30,493 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:50:30,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:50:30,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:50:30,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:50:30,494 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:30,603 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:50:30,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:50:30,891 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:50:30,891 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:50:30,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:50:30,939 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:50:30,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:50:30 BoogieIcfgContainer [2024-11-09 06:50:30,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:50:30,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:50:30,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:50:30,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:50:30,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:50:29" (1/3) ... [2024-11-09 06:50:30,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4563c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:50:30, skipping insertion in model container [2024-11-09 06:50:30,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:30" (2/3) ... [2024-11-09 06:50:30,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4563c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:50:30, skipping insertion in model container [2024-11-09 06:50:30,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:50:30" (3/3) ... [2024-11-09 06:50:30,949 INFO L112 eAbstractionObserver]: Analyzing ICFG 02-base_25-malloc_race_cp.i [2024-11-09 06:50:30,966 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:50:30,967 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-09 06:50:30,967 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:50:31,032 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:50:31,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 212 flow [2024-11-09 06:50:31,108 INFO L124 PetriNetUnfolderBase]: 0/103 cut-off events. [2024-11-09 06:50:31,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:31,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 103 events. 0/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-09 06:50:31,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 104 transitions, 212 flow [2024-11-09 06:50:31,117 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 103 transitions, 209 flow [2024-11-09 06:50:31,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:50:31,131 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;@6fff210c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:50:31,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 06:50:31,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:50:31,138 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-11-09 06:50:31,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:31,139 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:31,139 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] [2024-11-09 06:50:31,140 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:31,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:31,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2046640981, now seen corresponding path program 1 times [2024-11-09 06:50:31,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:31,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693998911] [2024-11-09 06:50:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:31,397 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,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:31,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693998911] [2024-11-09 06:50:31,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693998911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:31,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:31,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:31,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71953727] [2024-11-09 06:50:31,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:31,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:31,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:31,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2024-11-09 06:50:31,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:31,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2024-11-09 06:50:31,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:31,539 INFO L124 PetriNetUnfolderBase]: 12/234 cut-off events. [2024-11-09 06:50:31,540 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:50:31,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 234 events. 12/234 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 664 event pairs, 12 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 227. Up to 36 conditions per place. [2024-11-09 06:50:31,544 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 11 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2024-11-09 06:50:31,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 102 transitions, 233 flow [2024-11-09 06:50:31,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2024-11-09 06:50:31,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2024-11-09 06:50:31,559 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 209 flow. Second operand 3 states and 284 transitions. [2024-11-09 06:50:31,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 102 transitions, 233 flow [2024-11-09 06:50:31,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:50:31,572 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 210 flow [2024-11-09 06:50:31,574 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-11-09 06:50:31,577 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 0 predicate places. [2024-11-09 06:50:31,578 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 210 flow [2024-11-09 06:50:31,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:31,579 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] [2024-11-09 06:50:31,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:50:31,581 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:31,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:31,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1419190674, now seen corresponding path program 1 times [2024-11-09 06:50:31,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:31,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128804815] [2024-11-09 06:50:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:31,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:31,645 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,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:31,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128804815] [2024-11-09 06:50:31,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128804815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:31,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:31,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:31,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638086216] [2024-11-09 06:50:31,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:31,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:31,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:31,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:31,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2024-11-09 06:50:31,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:31,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2024-11-09 06:50:31,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:31,719 INFO L124 PetriNetUnfolderBase]: 9/200 cut-off events. [2024-11-09 06:50:31,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:31,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 200 events. 9/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 514 event pairs, 9 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 210. Up to 30 conditions per place. [2024-11-09 06:50:31,724 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 11 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-11-09 06:50:31,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 101 transitions, 234 flow [2024-11-09 06:50:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2024-11-09 06:50:31,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2024-11-09 06:50:31,727 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 210 flow. Second operand 3 states and 284 transitions. [2024-11-09 06:50:31,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 101 transitions, 234 flow [2024-11-09 06:50:31,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 101 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:31,729 INFO L231 Difference]: Finished difference. Result has 106 places, 101 transitions, 208 flow [2024-11-09 06:50:31,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=106, PETRI_TRANSITIONS=101} [2024-11-09 06:50:31,731 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, -1 predicate places. [2024-11-09 06:50:31,731 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 101 transitions, 208 flow [2024-11-09 06:50:31,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:31,732 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] [2024-11-09 06:50:31,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:50:31,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:31,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash 177711188, now seen corresponding path program 1 times [2024-11-09 06:50:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842369269] [2024-11-09 06:50:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:31,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:31,786 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,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:31,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842369269] [2024-11-09 06:50:31,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842369269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:31,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:31,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:31,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940212215] [2024-11-09 06:50:31,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:31,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:31,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:31,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:31,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:31,800 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 104 [2024-11-09 06:50:31,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 101 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:31,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 104 [2024-11-09 06:50:31,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:31,825 INFO L124 PetriNetUnfolderBase]: 8/165 cut-off events. [2024-11-09 06:50:31,826 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:50:31,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 165 events. 8/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 400 event pairs, 8 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 163. Up to 25 conditions per place. [2024-11-09 06:50:31,827 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 9 selfloop transitions, 1 changer transitions 0/99 dead transitions. [2024-11-09 06:50:31,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 224 flow [2024-11-09 06:50:31,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2024-11-09 06:50:31,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-11-09 06:50:31,829 INFO L175 Difference]: Start difference. First operand has 106 places, 101 transitions, 208 flow. Second operand 3 states and 288 transitions. [2024-11-09 06:50:31,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 224 flow [2024-11-09 06:50:31,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:50:31,831 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 202 flow [2024-11-09 06:50:31,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-11-09 06:50:31,832 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2024-11-09 06:50:31,832 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 202 flow [2024-11-09 06:50:31,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:31,832 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] [2024-11-09 06:50:31,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:50:31,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:31,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1291684622, now seen corresponding path program 1 times [2024-11-09 06:50:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:31,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441340834] [2024-11-09 06:50:31,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:31,887 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,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:31,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441340834] [2024-11-09 06:50:31,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441340834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:31,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:31,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:50:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453108427] [2024-11-09 06:50:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:31,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:31,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:31,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:31,899 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 104 [2024-11-09 06:50:31,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:31,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 104 [2024-11-09 06:50:31,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:31,935 INFO L124 PetriNetUnfolderBase]: 16/249 cut-off events. [2024-11-09 06:50:31,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:31,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 249 events. 16/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 822 event pairs, 7 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 262. Up to 36 conditions per place. [2024-11-09 06:50:31,937 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 12 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-11-09 06:50:31,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 234 flow [2024-11-09 06:50:31,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-11-09 06:50:31,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2024-11-09 06:50:31,939 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 202 flow. Second operand 3 states and 292 transitions. [2024-11-09 06:50:31,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 234 flow [2024-11-09 06:50:31,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 101 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:50:31,941 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 211 flow [2024-11-09 06:50:31,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=101, 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=211, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-11-09 06:50:31,942 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2024-11-09 06:50:31,942 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 211 flow [2024-11-09 06:50:31,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:31,943 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] [2024-11-09 06:50:31,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:50:31,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash 70069530, now seen corresponding path program 1 times [2024-11-09 06:50:31,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:31,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543396832] [2024-11-09 06:50:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:32,431 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,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:32,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543396832] [2024-11-09 06:50:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543396832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:32,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:32,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:32,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041285739] [2024-11-09 06:50:32,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:32,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:50:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:32,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:50:32,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:32,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 104 [2024-11-09 06:50:32,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:32,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 104 [2024-11-09 06:50:32,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:32,718 INFO L124 PetriNetUnfolderBase]: 231/839 cut-off events. [2024-11-09 06:50:32,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:50:32,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 839 events. 231/839 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4771 event pairs, 96 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1321. Up to 348 conditions per place. [2024-11-09 06:50:32,723 INFO L140 encePairwiseOnDemand]: 88/104 looper letters, 51 selfloop transitions, 41 changer transitions 0/163 dead transitions. [2024-11-09 06:50:32,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 163 transitions, 523 flow [2024-11-09 06:50:32,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:50:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:50:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 549 transitions. [2024-11-09 06:50:32,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8798076923076923 [2024-11-09 06:50:32,725 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 211 flow. Second operand 6 states and 549 transitions. [2024-11-09 06:50:32,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 163 transitions, 523 flow [2024-11-09 06:50:32,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 163 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:50:32,728 INFO L231 Difference]: Finished difference. Result has 113 places, 141 transitions, 469 flow [2024-11-09 06:50:32,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=104, 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=469, PETRI_PLACES=113, PETRI_TRANSITIONS=141} [2024-11-09 06:50:32,729 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2024-11-09 06:50:32,729 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 141 transitions, 469 flow [2024-11-09 06:50:32,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:32,730 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] [2024-11-09 06:50:32,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:50:32,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-11-09 06:50:32,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:32,731 INFO L85 PathProgramCache]: Analyzing trace with hash 87245971, now seen corresponding path program 1 times [2024-11-09 06:50:32,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:32,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796721311] [2024-11-09 06:50:32,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:32,934 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,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:32,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796721311] [2024-11-09 06:50:32,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796721311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:32,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:32,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:32,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96239255] [2024-11-09 06:50:32,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:32,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:50:32,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:32,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:50:32,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:33,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2024-11-09 06:50:33,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 141 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:33,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:33,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2024-11-09 06:50:33,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:33,331 INFO L124 PetriNetUnfolderBase]: 285/1134 cut-off events. [2024-11-09 06:50:33,331 INFO L125 PetriNetUnfolderBase]: For 318/367 co-relation queries the response was YES. [2024-11-09 06:50:33,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 1134 events. 285/1134 cut-off events. For 318/367 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7589 event pairs, 29 based on Foata normal form. 31/1130 useless extension candidates. Maximal degree in co-relation 2361. Up to 272 conditions per place. [2024-11-09 06:50:33,345 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 71 selfloop transitions, 48 changer transitions 0/216 dead transitions. [2024-11-09 06:50:33,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 216 transitions, 971 flow [2024-11-09 06:50:33,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:50:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:50:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 579 transitions. [2024-11-09 06:50:33,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9278846153846154 [2024-11-09 06:50:33,346 INFO L175 Difference]: Start difference. First operand has 113 places, 141 transitions, 469 flow. Second operand 6 states and 579 transitions. [2024-11-09 06:50:33,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 216 transitions, 971 flow [2024-11-09 06:50:33,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 216 transitions, 971 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:50:33,352 INFO L231 Difference]: Finished difference. Result has 123 places, 187 transitions, 875 flow [2024-11-09 06:50:33,352 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=113, 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=875, PETRI_PLACES=123, PETRI_TRANSITIONS=187} [2024-11-09 06:50:33,352 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 16 predicate places. [2024-11-09 06:50:33,353 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 187 transitions, 875 flow [2024-11-09 06:50:33,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:50:33,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:33,360 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] [2024-11-09 06:50:33,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:50:33,361 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:33,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash -587936594, now seen corresponding path program 1 times [2024-11-09 06:50:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:33,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7015455] [2024-11-09 06:50:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:33,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:33,471 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:33,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7015455] [2024-11-09 06:50:33,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7015455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:33,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:33,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:50:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904045143] [2024-11-09 06:50:33,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:33,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:33,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:33,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:33,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 104 [2024-11-09 06:50:33,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 187 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:33,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 104 [2024-11-09 06:50:33,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:33,568 INFO L124 PetriNetUnfolderBase]: 39/286 cut-off events. [2024-11-09 06:50:33,568 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-09 06:50:33,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 286 events. 39/286 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 967 event pairs, 4 based on Foata normal form. 2/275 useless extension candidates. Maximal degree in co-relation 499. Up to 64 conditions per place. [2024-11-09 06:50:33,575 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 2 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2024-11-09 06:50:33,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 413 flow [2024-11-09 06:50:33,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:50:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2024-11-09 06:50:33,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.967948717948718 [2024-11-09 06:50:33,576 INFO L175 Difference]: Start difference. First operand has 123 places, 187 transitions, 875 flow. Second operand 3 states and 302 transitions. [2024-11-09 06:50:33,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 413 flow [2024-11-09 06:50:33,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 120 transitions, 363 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-11-09 06:50:33,583 INFO L231 Difference]: Finished difference. Result has 116 places, 120 transitions, 359 flow [2024-11-09 06:50:33,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=351, 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=359, PETRI_PLACES=116, PETRI_TRANSITIONS=120} [2024-11-09 06:50:33,584 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 9 predicate places. [2024-11-09 06:50:33,584 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 120 transitions, 359 flow [2024-11-09 06:50:33,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:33,585 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:33,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:50:33,589 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:33,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:33,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1489826976, now seen corresponding path program 1 times [2024-11-09 06:50:33,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:33,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705594533] [2024-11-09 06:50:33,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:33,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:33,836 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:33,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:33,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705594533] [2024-11-09 06:50:33,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705594533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:33,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:33,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874394030] [2024-11-09 06:50:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:33,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:50:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:33,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:50:33,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:33,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 104 [2024-11-09 06:50:33,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 120 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 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,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:33,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 104 [2024-11-09 06:50:33,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:34,014 INFO L124 PetriNetUnfolderBase]: 93/482 cut-off events. [2024-11-09 06:50:34,015 INFO L125 PetriNetUnfolderBase]: For 90/103 co-relation queries the response was YES. [2024-11-09 06:50:34,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 482 events. 93/482 cut-off events. For 90/103 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2169 event pairs, 20 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 918. Up to 197 conditions per place. [2024-11-09 06:50:34,017 INFO L140 encePairwiseOnDemand]: 93/104 looper letters, 46 selfloop transitions, 22 changer transitions 0/141 dead transitions. [2024-11-09 06:50:34,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 141 transitions, 569 flow [2024-11-09 06:50:34,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:50:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:50:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2024-11-09 06:50:34,019 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8189102564102564 [2024-11-09 06:50:34,019 INFO L175 Difference]: Start difference. First operand has 116 places, 120 transitions, 359 flow. Second operand 6 states and 511 transitions. [2024-11-09 06:50:34,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 141 transitions, 569 flow [2024-11-09 06:50:34,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 141 transitions, 565 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:50:34,023 INFO L231 Difference]: Finished difference. Result has 125 places, 141 transitions, 537 flow [2024-11-09 06:50:34,023 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=537, PETRI_PLACES=125, PETRI_TRANSITIONS=141} [2024-11-09 06:50:34,025 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 18 predicate places. [2024-11-09 06:50:34,026 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 141 transitions, 537 flow [2024-11-09 06:50:34,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 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:34,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:34,027 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] [2024-11-09 06:50:34,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:50:34,027 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:34,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1812481170, now seen corresponding path program 1 times [2024-11-09 06:50:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:34,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465401592] [2024-11-09 06:50:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:34,270 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:34,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465401592] [2024-11-09 06:50:34,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465401592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:34,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:34,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:34,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46380493] [2024-11-09 06:50:34,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:34,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:50:34,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:34,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:50:34,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:34,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2024-11-09 06:50:34,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 141 transitions, 537 flow. Second operand has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 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:34,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:34,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2024-11-09 06:50:34,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:34,507 INFO L124 PetriNetUnfolderBase]: 195/735 cut-off events. [2024-11-09 06:50:34,508 INFO L125 PetriNetUnfolderBase]: For 309/316 co-relation queries the response was YES. [2024-11-09 06:50:34,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 735 events. 195/735 cut-off events. For 309/316 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4008 event pairs, 12 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 1782. Up to 295 conditions per place. [2024-11-09 06:50:34,512 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 56 selfloop transitions, 52 changer transitions 13/198 dead transitions. [2024-11-09 06:50:34,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 198 transitions, 1044 flow [2024-11-09 06:50:34,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:50:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:50:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2024-11-09 06:50:34,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8894230769230769 [2024-11-09 06:50:34,513 INFO L175 Difference]: Start difference. First operand has 125 places, 141 transitions, 537 flow. Second operand 6 states and 555 transitions. [2024-11-09 06:50:34,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 198 transitions, 1044 flow [2024-11-09 06:50:34,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 198 transitions, 1006 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-11-09 06:50:34,518 INFO L231 Difference]: Finished difference. Result has 135 places, 181 transitions, 952 flow [2024-11-09 06:50:34,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=952, PETRI_PLACES=135, PETRI_TRANSITIONS=181} [2024-11-09 06:50:34,519 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 28 predicate places. [2024-11-09 06:50:34,520 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 181 transitions, 952 flow [2024-11-09 06:50:34,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 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:34,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:34,521 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] [2024-11-09 06:50:34,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:50:34,521 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:34,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1380146183, now seen corresponding path program 1 times [2024-11-09 06:50:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:34,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033431918] [2024-11-09 06:50:34,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:34,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:34,864 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:34,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:34,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033431918] [2024-11-09 06:50:34,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033431918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:34,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:34,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 06:50:34,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831338124] [2024-11-09 06:50:34,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:34,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:50:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:34,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:50:34,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:50:35,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2024-11-09 06:50:35,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 181 transitions, 952 flow. Second operand has 12 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 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:35,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:35,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2024-11-09 06:50:35,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:35,556 INFO L124 PetriNetUnfolderBase]: 189/697 cut-off events. [2024-11-09 06:50:35,556 INFO L125 PetriNetUnfolderBase]: For 722/762 co-relation queries the response was YES. [2024-11-09 06:50:35,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 697 events. 189/697 cut-off events. For 722/762 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3753 event pairs, 18 based on Foata normal form. 21/711 useless extension candidates. Maximal degree in co-relation 2145. Up to 193 conditions per place. [2024-11-09 06:50:35,561 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 115 selfloop transitions, 39 changer transitions 20/235 dead transitions. [2024-11-09 06:50:35,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 235 transitions, 1684 flow [2024-11-09 06:50:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:50:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-09 06:50:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 998 transitions. [2024-11-09 06:50:35,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6854395604395604 [2024-11-09 06:50:35,563 INFO L175 Difference]: Start difference. First operand has 135 places, 181 transitions, 952 flow. Second operand 14 states and 998 transitions. [2024-11-09 06:50:35,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 235 transitions, 1684 flow [2024-11-09 06:50:35,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 235 transitions, 1633 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-11-09 06:50:35,573 INFO L231 Difference]: Finished difference. Result has 151 places, 189 transitions, 1096 flow [2024-11-09 06:50:35,574 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1096, PETRI_PLACES=151, PETRI_TRANSITIONS=189} [2024-11-09 06:50:35,574 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 44 predicate places. [2024-11-09 06:50:35,575 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 189 transitions, 1096 flow [2024-11-09 06:50:35,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 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:35,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:35,576 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] [2024-11-09 06:50:35,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:50:35,576 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:35,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1024159188, now seen corresponding path program 1 times [2024-11-09 06:50:35,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:35,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452615263] [2024-11-09 06:50:35,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:35,882 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:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:35,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452615263] [2024-11-09 06:50:35,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452615263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:35,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:35,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 06:50:35,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457839928] [2024-11-09 06:50:35,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:35,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:50:35,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:35,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:50:35,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:50:36,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 104 [2024-11-09 06:50:36,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 189 transitions, 1096 flow. Second operand has 12 states, 12 states have (on average 74.75) internal successors, (897), 12 states have internal predecessors, (897), 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:36,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:36,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 104 [2024-11-09 06:50:36,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:36,718 INFO L124 PetriNetUnfolderBase]: 175/639 cut-off events. [2024-11-09 06:50:36,718 INFO L125 PetriNetUnfolderBase]: For 1067/1101 co-relation queries the response was YES. [2024-11-09 06:50:36,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2249 conditions, 639 events. 175/639 cut-off events. For 1067/1101 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3310 event pairs, 4 based on Foata normal form. 23/660 useless extension candidates. Maximal degree in co-relation 2220. Up to 126 conditions per place. [2024-11-09 06:50:36,722 INFO L140 encePairwiseOnDemand]: 86/104 looper letters, 87 selfloop transitions, 68 changer transitions 11/235 dead transitions. [2024-11-09 06:50:36,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 235 transitions, 1801 flow [2024-11-09 06:50:36,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:50:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 06:50:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1035 transitions. [2024-11-09 06:50:36,724 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7655325443786982 [2024-11-09 06:50:36,724 INFO L175 Difference]: Start difference. First operand has 151 places, 189 transitions, 1096 flow. Second operand 13 states and 1035 transitions. [2024-11-09 06:50:36,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 235 transitions, 1801 flow [2024-11-09 06:50:36,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 235 transitions, 1759 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-11-09 06:50:36,734 INFO L231 Difference]: Finished difference. Result has 158 places, 197 transitions, 1388 flow [2024-11-09 06:50:36,735 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1388, PETRI_PLACES=158, PETRI_TRANSITIONS=197} [2024-11-09 06:50:36,735 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 51 predicate places. [2024-11-09 06:50:36,735 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 197 transitions, 1388 flow [2024-11-09 06:50:36,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.75) internal successors, (897), 12 states have internal predecessors, (897), 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:36,736 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:36,736 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:36,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:50:36,736 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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:36,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1647267624, now seen corresponding path program 1 times [2024-11-09 06:50:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50774287] [2024-11-09 06:50:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:37,038 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:37,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:37,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50774287] [2024-11-09 06:50:37,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50774287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:37,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:37,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 06:50:37,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879290464] [2024-11-09 06:50:37,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:37,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:50:37,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:37,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:50:37,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:50:37,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2024-11-09 06:50:37,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 197 transitions, 1388 flow. Second operand has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 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:37,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:37,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2024-11-09 06:50:37,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:37,663 INFO L124 PetriNetUnfolderBase]: 170/661 cut-off events. [2024-11-09 06:50:37,663 INFO L125 PetriNetUnfolderBase]: For 2024/2103 co-relation queries the response was YES. [2024-11-09 06:50:37,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 661 events. 170/661 cut-off events. For 2024/2103 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3544 event pairs, 15 based on Foata normal form. 43/698 useless extension candidates. Maximal degree in co-relation 2531. Up to 192 conditions per place. [2024-11-09 06:50:37,668 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 122 selfloop transitions, 35 changer transitions 12/231 dead transitions. [2024-11-09 06:50:37,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 231 transitions, 2092 flow [2024-11-09 06:50:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 06:50:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-09 06:50:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1125 transitions. [2024-11-09 06:50:37,671 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6760817307692307 [2024-11-09 06:50:37,671 INFO L175 Difference]: Start difference. First operand has 158 places, 197 transitions, 1388 flow. Second operand 16 states and 1125 transitions. [2024-11-09 06:50:37,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 231 transitions, 2092 flow [2024-11-09 06:50:37,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 231 transitions, 2062 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 06:50:37,684 INFO L231 Difference]: Finished difference. Result has 168 places, 193 transitions, 1394 flow [2024-11-09 06:50:37,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1394, PETRI_PLACES=168, PETRI_TRANSITIONS=193} [2024-11-09 06:50:37,685 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 61 predicate places. [2024-11-09 06:50:37,685 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 193 transitions, 1394 flow [2024-11-09 06:50:37,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 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:37,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:37,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, 1] [2024-11-09 06:50:37,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:50:37,686 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:37,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2132507222, now seen corresponding path program 2 times [2024-11-09 06:50:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:37,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003616044] [2024-11-09 06:50:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:38,077 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:38,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:50:38,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003616044] [2024-11-09 06:50:38,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003616044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:38,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:38,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 06:50:38,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626694550] [2024-11-09 06:50:38,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:38,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:50:38,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:50:38,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:50:38,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:50:38,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2024-11-09 06:50:38,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 193 transitions, 1394 flow. Second operand has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 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:38,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:50:38,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2024-11-09 06:50:38,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:50:38,698 INFO L124 PetriNetUnfolderBase]: 165/646 cut-off events. [2024-11-09 06:50:38,698 INFO L125 PetriNetUnfolderBase]: For 2108/2139 co-relation queries the response was YES. [2024-11-09 06:50:38,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 646 events. 165/646 cut-off events. For 2108/2139 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3426 event pairs, 15 based on Foata normal form. 13/653 useless extension candidates. Maximal degree in co-relation 2560. Up to 192 conditions per place. [2024-11-09 06:50:38,702 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 118 selfloop transitions, 34 changer transitions 10/224 dead transitions. [2024-11-09 06:50:38,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 224 transitions, 2062 flow [2024-11-09 06:50:38,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 06:50:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-09 06:50:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1186 transitions. [2024-11-09 06:50:38,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.670814479638009 [2024-11-09 06:50:38,705 INFO L175 Difference]: Start difference. First operand has 168 places, 193 transitions, 1394 flow. Second operand 17 states and 1186 transitions. [2024-11-09 06:50:38,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 224 transitions, 2062 flow [2024-11-09 06:50:38,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 224 transitions, 1976 flow, removed 4 selfloop flow, removed 15 redundant places. [2024-11-09 06:50:38,718 INFO L231 Difference]: Finished difference. Result has 165 places, 188 transitions, 1339 flow [2024-11-09 06:50:38,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1339, PETRI_PLACES=165, PETRI_TRANSITIONS=188} [2024-11-09 06:50:38,719 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 58 predicate places. [2024-11-09 06:50:38,719 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 188 transitions, 1339 flow [2024-11-09 06:50:38,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 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:38,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:50:38,720 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:38,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:50:38,720 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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:38,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1762241086, now seen corresponding path program 1 times [2024-11-09 06:50:38,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:50:38,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389828335] [2024-11-09 06:50:38,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:38,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:38,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:50:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:38,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:50:38,788 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:50:38,789 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-11-09 06:50:38,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-09 06:50:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-09 06:50:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-09 06:50:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-09 06:50:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-09 06:50:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2024-11-09 06:50:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-09 06:50:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-09 06:50:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-09 06:50:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-09 06:50:38,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-09 06:50:38,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-09 06:50:38,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-09 06:50:38,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-09 06:50:38,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:50:38,792 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:38,842 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:50:38,842 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:50:38,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:50:38 BasicIcfg [2024-11-09 06:50:38,850 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:50:38,851 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:50:38,851 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:50:38,851 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:50:38,851 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:30" (3/4) ... [2024-11-09 06:50:38,856 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 06:50:38,908 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:50:38,908 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:50:38,908 INFO L158 Benchmark]: Toolchain (without parser) took 9233.68ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 85.8MB in the beginning and 221.1MB in the end (delta: -135.3MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-09 06:50:38,908 INFO L158 Benchmark]: CDTParser took 3.70ms. Allocated memory is still 159.4MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:50:38,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 664.54ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 95.5MB in the end (delta: -9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 06:50:38,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.66ms. Allocated memory is still 159.4MB. Free memory was 95.5MB in the beginning and 92.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:50:38,909 INFO L158 Benchmark]: Boogie Preprocessor took 25.90ms. Allocated memory is still 159.4MB. Free memory was 92.6MB in the beginning and 91.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:50:38,909 INFO L158 Benchmark]: RCFGBuilder took 525.80ms. Allocated memory is still 159.4MB. Free memory was 91.3MB in the beginning and 73.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 06:50:38,909 INFO L158 Benchmark]: TraceAbstraction took 7909.61ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 72.4MB in the beginning and 228.5MB in the end (delta: -156.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-09 06:50:38,910 INFO L158 Benchmark]: Witness Printer took 57.13ms. Allocated memory is still 327.2MB. Free memory was 228.5MB in the beginning and 221.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 06:50:38,911 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.70ms. Allocated memory is still 159.4MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 664.54ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 95.5MB in the end (delta: -9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.66ms. Allocated memory is still 159.4MB. Free memory was 95.5MB in the beginning and 92.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.90ms. Allocated memory is still 159.4MB. Free memory was 92.6MB in the beginning and 91.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 525.80ms. Allocated memory is still 159.4MB. Free memory was 91.3MB in the beginning and 73.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7909.61ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 72.4MB in the beginning and 228.5MB in the end (delta: -156.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Witness Printer took 57.13ms. Allocated memory is still 327.2MB. Free memory was 228.5MB in the beginning and 221.1MB 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: 1243]: 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 int *z; VAL [m={1:0}, x={0:0}, y={0:0}] [L1236] 0 x = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={0:0}] [L1237] 0 y = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={-3:0}] [L1238] 0 z = y VAL [m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1239] 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}, z={-3:0}] [L1241] EXPR 0 *x VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] EXPR 0 \read(*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] 0 printf("%d\n",*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-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}] [L1243] EXPR 0 \read(*z) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-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}] [L1243] 0 printf("%d\n",*z) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-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 = malloc(sizeof(int)) [1236] * C: *y = 8 [1229] * C: *x = 3 [1228] * C: y = malloc(sizeof(int)) [1237] * C: *x = 3 [1228] * C: *x = 3 [1228] and C: printf("%d\n",*z) [1243] - 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: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: 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: 1241]: 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 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, 138 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: 7.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1436 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1129 mSDsluCounter, 1258 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1195 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5066 IncrementalHoareTripleChecker+Invalid, 5298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 63 mSDtfsCounter, 5066 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1394occurred in iteration=12, InterpolantAutomatonStates: 99, 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, 2.6s InterpolantComputationTime, 759 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 668 ConstructedInterpolants, 0 QuantifiedInterpolants, 2320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:38,931 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