./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_44-malloc_sound.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_44-malloc_sound.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8d85985769788fe03edac99b0e2515850ec4c864737a042b27bc3e336515bcde --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:06:10,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:06:10,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:06:10,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:06:10,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:06:10,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:06:10,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:06:10,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:06:10,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:06:10,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:06:10,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:06:10,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:06:10,787 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:06:10,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:06:10,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:06:10,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:06:10,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:06:10,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:06:10,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:06:10,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:06:10,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:06:10,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:06:10,792 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:06:10,792 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:06:10,792 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:06:10,792 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:06:10,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:06:10,793 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:06:10,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:06:10,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:06:10,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:06:10,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:06:10,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:06:10,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:06:10,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:06:10,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:06:10,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:06:10,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:06:10,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:06:10,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:06:10,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:06:10,796 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-clean/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-clean/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 -> 8d85985769788fe03edac99b0e2515850ec4c864737a042b27bc3e336515bcde [2024-10-11 17:06:11,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:06:11,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:06:11,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:06:11,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:06:11,036 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:06:11,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_44-malloc_sound.i [2024-10-11 17:06:12,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:06:12,465 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:06:12,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_44-malloc_sound.i [2024-10-11 17:06:12,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/86e0fe4f5/d9d3b365994442c6a33ce71be0c7979a/FLAG4fc1b5db5 [2024-10-11 17:06:12,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/86e0fe4f5/d9d3b365994442c6a33ce71be0c7979a [2024-10-11 17:06:12,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:06:12,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:06:12,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:06:12,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:06:12,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:06:12,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:12,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bae46ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12, skipping insertion in model container [2024-10-11 17:06:12,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:12,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:06:12,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:06:12,892 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:06:12,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:06:12,957 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:06:12,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12 WrapperNode [2024-10-11 17:06:12,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:06:12,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:06:12,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:06:12,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:06:12,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:12,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:12,989 INFO L138 Inliner]: procedures = 261, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2024-10-11 17:06:12,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:06:12,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:06:12,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:06:12,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:06:12,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:12,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:12,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:12,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:13,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:13,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:13,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:13,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:13,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:06:13,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:06:13,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:06:13,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:06:13,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (1/1) ... [2024-10-11 17:06:13,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:06:13,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:13,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:06:13,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:06:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-11 17:06:13,067 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-11 17:06:13,067 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:06:13,067 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:06:13,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:06:13,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:06:13,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:06:13,068 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:06:13,180 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:06:13,182 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:06:13,299 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:06:13,301 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:06:13,320 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:06:13,320 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 17:06:13,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:06:13 BoogieIcfgContainer [2024-10-11 17:06:13,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:06:13,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:06:13,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:06:13,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:06:13,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:06:12" (1/3) ... [2024-10-11 17:06:13,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b6893c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:06:13, skipping insertion in model container [2024-10-11 17:06:13,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:12" (2/3) ... [2024-10-11 17:06:13,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b6893c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:06:13, skipping insertion in model container [2024-10-11 17:06:13,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:06:13" (3/3) ... [2024-10-11 17:06:13,328 INFO L112 eAbstractionObserver]: Analyzing ICFG 04-mutex_44-malloc_sound.i [2024-10-11 17:06:13,342 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:06:13,343 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-11 17:06:13,343 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:06:13,385 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:06:13,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 92 transitions, 188 flow [2024-10-11 17:06:13,435 INFO L124 PetriNetUnfolderBase]: 4/91 cut-off events. [2024-10-11 17:06:13,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:06:13,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 4/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 163 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-10-11 17:06:13,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 92 transitions, 188 flow [2024-10-11 17:06:13,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 91 transitions, 185 flow [2024-10-11 17:06:13,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:06:13,452 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;@25f366dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:06:13,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-11 17:06:13,458 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:06:13,459 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-10-11 17:06:13,459 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:06:13,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:13,459 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-10-11 17:06:13,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:13,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash 644524114, now seen corresponding path program 1 times [2024-10-11 17:06:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:13,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628915243] [2024-10-11 17:06:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:06:13,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:13,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628915243] [2024-10-11 17:06:13,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628915243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:06:13,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:06:13,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:06:13,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133520996] [2024-10-11 17:06:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:06:13,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:06:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:13,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:06:13,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:06:13,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 92 [2024-10-11 17:06:13,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:13,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:13,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 92 [2024-10-11 17:06:13,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:13,750 INFO L124 PetriNetUnfolderBase]: 9/165 cut-off events. [2024-10-11 17:06:13,750 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:06:13,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 165 events. 9/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 385 event pairs, 6 based on Foata normal form. 3/147 useless extension candidates. Maximal degree in co-relation 134. Up to 26 conditions per place. [2024-10-11 17:06:13,755 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 12 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-10-11 17:06:13,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 213 flow [2024-10-11 17:06:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:06:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:06:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2024-10-11 17:06:13,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2024-10-11 17:06:13,767 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 185 flow. Second operand 3 states and 253 transitions. [2024-10-11 17:06:13,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 213 flow [2024-10-11 17:06:13,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:06:13,776 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 198 flow [2024-10-11 17:06:13,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2024-10-11 17:06:13,780 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2024-10-11 17:06:13,781 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 198 flow [2024-10-11 17:06:13,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:13,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:13,782 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] [2024-10-11 17:06:13,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:06:13,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:13,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1080794383, now seen corresponding path program 1 times [2024-10-11 17:06:13,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:13,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698185069] [2024-10-11 17:06:13,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:13,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:06:13,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698185069] [2024-10-11 17:06:13,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698185069] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:06:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380122459] [2024-10-11 17:06:13,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:13,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:13,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:13,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:06:13,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:06:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:14,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:06:14,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:06:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:06:14,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:06:14,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380122459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:06:14,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:06:14,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 17:06:14,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865436481] [2024-10-11 17:06:14,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:06:14,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:06:14,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:14,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:06:14,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:06:14,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2024-10-11 17:06:14,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:14,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:14,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2024-10-11 17:06:14,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:14,079 INFO L124 PetriNetUnfolderBase]: 15/151 cut-off events. [2024-10-11 17:06:14,079 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:06:14,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 151 events. 15/151 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 415 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 170. Up to 30 conditions per place. [2024-10-11 17:06:14,081 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 11 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2024-10-11 17:06:14,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 222 flow [2024-10-11 17:06:14,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:06:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:06:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2024-10-11 17:06:14,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9094202898550725 [2024-10-11 17:06:14,084 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 198 flow. Second operand 3 states and 251 transitions. [2024-10-11 17:06:14,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 222 flow [2024-10-11 17:06:14,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:06:14,088 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 194 flow [2024-10-11 17:06:14,089 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2024-10-11 17:06:14,089 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2024-10-11 17:06:14,090 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 194 flow [2024-10-11 17:06:14,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:14,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:14,090 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-10-11 17:06:14,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:06:14,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:14,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:14,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash -857199266, now seen corresponding path program 1 times [2024-10-11 17:06:14,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031536138] [2024-10-11 17:06:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:06:14,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:14,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031536138] [2024-10-11 17:06:14,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031536138] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:06:14,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835079624] [2024-10-11 17:06:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:14,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:14,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:14,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:06:14,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:06:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:14,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:06:14,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:06:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:06:14,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:06:14,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835079624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:06:14,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:06:14,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 17:06:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772849238] [2024-10-11 17:06:14,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:06:14,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:06:14,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:14,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:06:14,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:06:14,438 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2024-10-11 17:06:14,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:14,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:14,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2024-10-11 17:06:14,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:14,465 INFO L124 PetriNetUnfolderBase]: 15/153 cut-off events. [2024-10-11 17:06:14,465 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:06:14,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 153 events. 15/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 421 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 145. Up to 30 conditions per place. [2024-10-11 17:06:14,466 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 11 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2024-10-11 17:06:14,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 89 transitions, 218 flow [2024-10-11 17:06:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:06:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:06:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2024-10-11 17:06:14,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9094202898550725 [2024-10-11 17:06:14,468 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 194 flow. Second operand 3 states and 251 transitions. [2024-10-11 17:06:14,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 89 transitions, 218 flow [2024-10-11 17:06:14,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:06:14,470 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 191 flow [2024-10-11 17:06:14,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2024-10-11 17:06:14,470 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2024-10-11 17:06:14,470 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 191 flow [2024-10-11 17:06:14,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:14,471 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:14,471 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:06:14,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:06:14,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:14,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:14,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2011547939, now seen corresponding path program 1 times [2024-10-11 17:06:14,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:14,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963540582] [2024-10-11 17:06:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:14,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:06:14,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:14,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963540582] [2024-10-11 17:06:14,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963540582] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:06:14,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825124026] [2024-10-11 17:06:14,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:14,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:14,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:14,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:06:14,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:06:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:14,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:06:14,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:06:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:06:14,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:06:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825124026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:06:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:06:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 17:06:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27896110] [2024-10-11 17:06:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:06:14,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:06:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:06:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:06:14,851 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 92 [2024-10-11 17:06:14,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:14,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:14,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 92 [2024-10-11 17:06:14,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:14,896 INFO L124 PetriNetUnfolderBase]: 18/201 cut-off events. [2024-10-11 17:06:14,896 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:06:14,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 201 events. 18/201 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 671 event pairs, 10 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 146. Up to 35 conditions per place. [2024-10-11 17:06:14,898 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 14 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2024-10-11 17:06:14,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 91 transitions, 237 flow [2024-10-11 17:06:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:06:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:06:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2024-10-11 17:06:14,899 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2024-10-11 17:06:14,899 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 191 flow. Second operand 3 states and 252 transitions. [2024-10-11 17:06:14,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 91 transitions, 237 flow [2024-10-11 17:06:14,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:06:14,901 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 206 flow [2024-10-11 17:06:14,901 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2024-10-11 17:06:14,902 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2024-10-11 17:06:14,902 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 206 flow [2024-10-11 17:06:14,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:14,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:14,903 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:06:14,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:06:15,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:15,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:15,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2034720996, now seen corresponding path program 1 times [2024-10-11 17:06:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:15,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354792130] [2024-10-11 17:06:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:06:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354792130] [2024-10-11 17:06:15,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354792130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:06:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484033938] [2024-10-11 17:06:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:15,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:15,199 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:06:15,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:06:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:15,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:06:15,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:06:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 17:06:15,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:06:15,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484033938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:06:15,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:06:15,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 17:06:15,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338871475] [2024-10-11 17:06:15,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:06:15,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:06:15,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:15,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:06:15,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:06:15,289 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 92 [2024-10-11 17:06:15,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:15,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:15,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 92 [2024-10-11 17:06:15,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:15,340 INFO L124 PetriNetUnfolderBase]: 28/293 cut-off events. [2024-10-11 17:06:15,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:06:15,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 293 events. 28/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1201 event pairs, 13 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 286. Up to 48 conditions per place. [2024-10-11 17:06:15,344 INFO L140 encePairwiseOnDemand]: 87/92 looper letters, 14 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2024-10-11 17:06:15,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 255 flow [2024-10-11 17:06:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:06:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:06:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2024-10-11 17:06:15,345 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2024-10-11 17:06:15,345 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 206 flow. Second operand 3 states and 253 transitions. [2024-10-11 17:06:15,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 255 flow [2024-10-11 17:06:15,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:06:15,348 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 226 flow [2024-10-11 17:06:15,350 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2024-10-11 17:06:15,351 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2024-10-11 17:06:15,351 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 226 flow [2024-10-11 17:06:15,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:15,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:15,352 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] [2024-10-11 17:06:15,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:06:15,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:15,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:15,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:15,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1197608942, now seen corresponding path program 1 times [2024-10-11 17:06:15,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:15,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476115146] [2024-10-11 17:06:15,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:15,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:06:15,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:15,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476115146] [2024-10-11 17:06:15,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476115146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:06:15,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883812596] [2024-10-11 17:06:15,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:15,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:15,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:15,616 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:06:15,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:06:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:15,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:06:15,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:06:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:06:15,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:06:15,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883812596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:06:15,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:06:15,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 17:06:15,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561933730] [2024-10-11 17:06:15,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:06:15,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:06:15,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:15,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:06:15,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:06:15,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 92 [2024-10-11 17:06:15,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:15,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:15,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 92 [2024-10-11 17:06:15,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:15,729 INFO L124 PetriNetUnfolderBase]: 46/395 cut-off events. [2024-10-11 17:06:15,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:06:15,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 395 events. 46/395 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2025 event pairs, 15 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 440. Up to 56 conditions per place. [2024-10-11 17:06:15,731 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 17 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2024-10-11 17:06:15,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 292 flow [2024-10-11 17:06:15,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:06:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:06:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2024-10-11 17:06:15,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2024-10-11 17:06:15,732 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 226 flow. Second operand 3 states and 259 transitions. [2024-10-11 17:06:15,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 292 flow [2024-10-11 17:06:15,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 100 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:06:15,734 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 274 flow [2024-10-11 17:06:15,734 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2024-10-11 17:06:15,735 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2024-10-11 17:06:15,735 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 274 flow [2024-10-11 17:06:15,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:15,735 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:15,735 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:06:15,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:06:15,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:15,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:15,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:15,940 INFO L85 PathProgramCache]: Analyzing trace with hash -640616272, now seen corresponding path program 1 times [2024-10-11 17:06:15,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:15,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133114499] [2024-10-11 17:06:15,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:15,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:06:15,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:15,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133114499] [2024-10-11 17:06:15,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133114499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:06:15,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987017285] [2024-10-11 17:06:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:15,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:15,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:15,981 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:06:15,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:06:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:16,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:06:16,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:06:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:06:16,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:06:16,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987017285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:06:16,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:06:16,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 17:06:16,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961356829] [2024-10-11 17:06:16,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:06:16,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:06:16,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:16,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:06:16,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:06:16,063 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 92 [2024-10-11 17:06:16,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:16,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:16,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 92 [2024-10-11 17:06:16,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:16,114 INFO L124 PetriNetUnfolderBase]: 61/460 cut-off events. [2024-10-11 17:06:16,115 INFO L125 PetriNetUnfolderBase]: For 103/108 co-relation queries the response was YES. [2024-10-11 17:06:16,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 460 events. 61/460 cut-off events. For 103/108 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2573 event pairs, 23 based on Foata normal form. 3/442 useless extension candidates. Maximal degree in co-relation 524. Up to 103 conditions per place. [2024-10-11 17:06:16,117 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 16 selfloop transitions, 7 changer transitions 2/103 dead transitions. [2024-10-11 17:06:16,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 103 transitions, 346 flow [2024-10-11 17:06:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:06:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:06:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2024-10-11 17:06:16,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9202898550724637 [2024-10-11 17:06:16,121 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 274 flow. Second operand 3 states and 254 transitions. [2024-10-11 17:06:16,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 103 transitions, 346 flow [2024-10-11 17:06:16,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 103 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:06:16,124 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 314 flow [2024-10-11 17:06:16,124 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2024-10-11 17:06:16,124 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 7 predicate places. [2024-10-11 17:06:16,126 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 100 transitions, 314 flow [2024-10-11 17:06:16,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:16,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:16,126 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] [2024-10-11 17:06:16,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 17:06:16,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 17:06:16,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:16,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1738734521, now seen corresponding path program 1 times [2024-10-11 17:06:16,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:16,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4220368] [2024-10-11 17:06:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:16,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:06:16,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:16,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4220368] [2024-10-11 17:06:16,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4220368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:06:16,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223498291] [2024-10-11 17:06:16,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:16,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:16,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:16,392 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:06:16,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 17:06:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:16,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:06:16,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:06:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:06:16,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:06:16,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223498291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:06:16,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:06:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-11 17:06:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421835598] [2024-10-11 17:06:16,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:06:16,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:06:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:06:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:06:16,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 92 [2024-10-11 17:06:16,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:16,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:16,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 92 [2024-10-11 17:06:16,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:16,519 INFO L124 PetriNetUnfolderBase]: 79/520 cut-off events. [2024-10-11 17:06:16,520 INFO L125 PetriNetUnfolderBase]: For 237/244 co-relation queries the response was YES. [2024-10-11 17:06:16,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 520 events. 79/520 cut-off events. For 237/244 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3024 event pairs, 27 based on Foata normal form. 2/503 useless extension candidates. Maximal degree in co-relation 718. Up to 128 conditions per place. [2024-10-11 17:06:16,521 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 17 selfloop transitions, 7 changer transitions 7/107 dead transitions. [2024-10-11 17:06:16,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 400 flow [2024-10-11 17:06:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:06:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:06:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2024-10-11 17:06:16,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9057971014492754 [2024-10-11 17:06:16,522 INFO L175 Difference]: Start difference. First operand has 98 places, 100 transitions, 314 flow. Second operand 3 states and 250 transitions. [2024-10-11 17:06:16,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 400 flow [2024-10-11 17:06:16,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:06:16,527 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 332 flow [2024-10-11 17:06:16,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2024-10-11 17:06:16,529 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 9 predicate places. [2024-10-11 17:06:16,529 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 332 flow [2024-10-11 17:06:16,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:16,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:16,530 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] [2024-10-11 17:06:16,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 17:06:16,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:16,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:16,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1976075803, now seen corresponding path program 1 times [2024-10-11 17:06:16,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:16,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197569579] [2024-10-11 17:06:16,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:16,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:06:16,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:16,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197569579] [2024-10-11 17:06:16,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197569579] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:06:16,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015901187] [2024-10-11 17:06:16,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:16,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:16,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:16,794 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:06:16,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 17:06:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:16,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:06:16,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:06:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:06:16,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:06:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:06:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015901187] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:06:16,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:06:16,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:06:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655071016] [2024-10-11 17:06:16,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:06:16,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:06:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:16,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:06:16,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:06:16,954 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 92 [2024-10-11 17:06:16,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 99 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:16,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:16,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 92 [2024-10-11 17:06:16,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:17,056 INFO L124 PetriNetUnfolderBase]: 40/464 cut-off events. [2024-10-11 17:06:17,057 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-10-11 17:06:17,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 464 events. 40/464 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2373 event pairs, 12 based on Foata normal form. 7/458 useless extension candidates. Maximal degree in co-relation 508. Up to 54 conditions per place. [2024-10-11 17:06:17,058 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 15 selfloop transitions, 13 changer transitions 0/110 dead transitions. [2024-10-11 17:06:17,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 416 flow [2024-10-11 17:06:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:06:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:06:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 857 transitions. [2024-10-11 17:06:17,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8468379446640316 [2024-10-11 17:06:17,060 INFO L175 Difference]: Start difference. First operand has 100 places, 99 transitions, 332 flow. Second operand 11 states and 857 transitions. [2024-10-11 17:06:17,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 416 flow [2024-10-11 17:06:17,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 110 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:06:17,063 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 392 flow [2024-10-11 17:06:17,063 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=392, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2024-10-11 17:06:17,064 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 20 predicate places. [2024-10-11 17:06:17,064 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 392 flow [2024-10-11 17:06:17,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:17,064 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:17,065 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:06:17,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 17:06:17,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:17,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:17,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:17,266 INFO L85 PathProgramCache]: Analyzing trace with hash -227121693, now seen corresponding path program 2 times [2024-10-11 17:06:17,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:17,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940451854] [2024-10-11 17:06:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:17,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 17:06:17,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:17,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940451854] [2024-10-11 17:06:17,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940451854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:06:17,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:06:17,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:06:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020600971] [2024-10-11 17:06:17,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:06:17,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:06:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:17,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:06:17,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:06:17,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2024-10-11 17:06:17,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:17,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:17,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2024-10-11 17:06:17,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:17,512 INFO L124 PetriNetUnfolderBase]: 58/797 cut-off events. [2024-10-11 17:06:17,512 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2024-10-11 17:06:17,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 797 events. 58/797 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5300 event pairs, 13 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 487. Up to 74 conditions per place. [2024-10-11 17:06:17,516 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 13 selfloop transitions, 11 changer transitions 8/130 dead transitions. [2024-10-11 17:06:17,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 130 transitions, 504 flow [2024-10-11 17:06:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:06:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 17:06:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 601 transitions. [2024-10-11 17:06:17,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9332298136645962 [2024-10-11 17:06:17,517 INFO L175 Difference]: Start difference. First operand has 111 places, 108 transitions, 392 flow. Second operand 7 states and 601 transitions. [2024-10-11 17:06:17,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 130 transitions, 504 flow [2024-10-11 17:06:17,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 130 transitions, 492 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-10-11 17:06:17,521 INFO L231 Difference]: Finished difference. Result has 118 places, 115 transitions, 429 flow [2024-10-11 17:06:17,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=118, PETRI_TRANSITIONS=115} [2024-10-11 17:06:17,522 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 27 predicate places. [2024-10-11 17:06:17,523 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 115 transitions, 429 flow [2024-10-11 17:06:17,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:17,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:17,524 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:06:17,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:06:17,524 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:17,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:17,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2111580457, now seen corresponding path program 1 times [2024-10-11 17:06:17,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:17,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273406980] [2024-10-11 17:06:17,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:17,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:06:17,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273406980] [2024-10-11 17:06:17,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273406980] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:06:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152803012] [2024-10-11 17:06:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:17,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:17,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:17,625 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:06:17,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 17:06:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:17,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:06:17,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:06:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:06:17,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:06:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:06:17,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152803012] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:06:17,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:06:17,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-11 17:06:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464015252] [2024-10-11 17:06:17,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:06:17,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:06:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:17,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:06:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:06:17,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 92 [2024-10-11 17:06:17,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 115 transitions, 429 flow. Second operand has 14 states, 14 states have (on average 78.0) internal successors, (1092), 14 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:17,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:17,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 92 [2024-10-11 17:06:17,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:18,015 INFO L124 PetriNetUnfolderBase]: 58/761 cut-off events. [2024-10-11 17:06:18,015 INFO L125 PetriNetUnfolderBase]: For 309/315 co-relation queries the response was YES. [2024-10-11 17:06:18,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 761 events. 58/761 cut-off events. For 309/315 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4490 event pairs, 14 based on Foata normal form. 14/754 useless extension candidates. Maximal degree in co-relation 594. Up to 94 conditions per place. [2024-10-11 17:06:18,018 INFO L140 encePairwiseOnDemand]: 85/92 looper letters, 21 selfloop transitions, 20 changer transitions 0/128 dead transitions. [2024-10-11 17:06:18,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 128 transitions, 569 flow [2024-10-11 17:06:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 17:06:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-11 17:06:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1332 transitions. [2024-10-11 17:06:18,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8516624040920716 [2024-10-11 17:06:18,021 INFO L175 Difference]: Start difference. First operand has 118 places, 115 transitions, 429 flow. Second operand 17 states and 1332 transitions. [2024-10-11 17:06:18,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 128 transitions, 569 flow [2024-10-11 17:06:18,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 128 transitions, 567 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 17:06:18,023 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 560 flow [2024-10-11 17:06:18,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=560, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2024-10-11 17:06:18,024 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 46 predicate places. [2024-10-11 17:06:18,024 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 560 flow [2024-10-11 17:06:18,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 78.0) internal successors, (1092), 14 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:18,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:18,025 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:06:18,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 17:06:18,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:18,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:18,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash -279629298, now seen corresponding path program 1 times [2024-10-11 17:06:18,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:18,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15962396] [2024-10-11 17:06:18,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:18,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 17:06:18,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:18,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15962396] [2024-10-11 17:06:18,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15962396] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:06:18,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509249405] [2024-10-11 17:06:18,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:18,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:18,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:18,324 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:06:18,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 17:06:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:18,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 17:06:18,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:06:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 17:06:18,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:06:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 17:06:18,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509249405] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:06:18,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:06:18,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2024-10-11 17:06:18,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222687990] [2024-10-11 17:06:18,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:06:18,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:06:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:06:18,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:06:18,548 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 92 [2024-10-11 17:06:18,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 76.86666666666666) internal successors, (1153), 15 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:18,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:18,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 92 [2024-10-11 17:06:18,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:18,771 INFO L124 PetriNetUnfolderBase]: 64/772 cut-off events. [2024-10-11 17:06:18,772 INFO L125 PetriNetUnfolderBase]: For 549/555 co-relation queries the response was YES. [2024-10-11 17:06:18,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 772 events. 64/772 cut-off events. For 549/555 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3615 event pairs, 13 based on Foata normal form. 9/761 useless extension candidates. Maximal degree in co-relation 820. Up to 66 conditions per place. [2024-10-11 17:06:18,775 INFO L140 encePairwiseOnDemand]: 83/92 looper letters, 29 selfloop transitions, 45 changer transitions 1/158 dead transitions. [2024-10-11 17:06:18,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 158 transitions, 906 flow [2024-10-11 17:06:18,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 17:06:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-11 17:06:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1613 transitions. [2024-10-11 17:06:18,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8348861283643892 [2024-10-11 17:06:18,778 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 560 flow. Second operand 21 states and 1613 transitions. [2024-10-11 17:06:18,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 158 transitions, 906 flow [2024-10-11 17:06:18,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 158 transitions, 888 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-10-11 17:06:18,782 INFO L231 Difference]: Finished difference. Result has 156 places, 146 transitions, 823 flow [2024-10-11 17:06:18,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=823, PETRI_PLACES=156, PETRI_TRANSITIONS=146} [2024-10-11 17:06:18,782 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 65 predicate places. [2024-10-11 17:06:18,783 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 146 transitions, 823 flow [2024-10-11 17:06:18,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 76.86666666666666) internal successors, (1153), 15 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:18,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:18,783 INFO L204 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:06:18,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 17:06:18,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 17:06:18,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:18,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:18,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2019335057, now seen corresponding path program 2 times [2024-10-11 17:06:18,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:18,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985320238] [2024-10-11 17:06:18,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:18,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:06:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:06:19,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:06:19,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985320238] [2024-10-11 17:06:19,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985320238] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:06:19,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479802630] [2024-10-11 17:06:19,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:06:19,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:06:19,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:06:19,182 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:06:19,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 17:06:19,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:06:19,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:06:19,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 17:06:19,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:06:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:06:19,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:06:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 17:06:19,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479802630] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:06:19,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:06:19,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17 [2024-10-11 17:06:19,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512895675] [2024-10-11 17:06:19,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:06:19,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 17:06:19,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:06:19,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 17:06:19,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:06:19,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 92 [2024-10-11 17:06:19,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 146 transitions, 823 flow. Second operand has 17 states, 17 states have (on average 77.52941176470588) internal successors, (1318), 17 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:19,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:06:19,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 92 [2024-10-11 17:06:19,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:06:19,695 INFO L124 PetriNetUnfolderBase]: 37/455 cut-off events. [2024-10-11 17:06:19,695 INFO L125 PetriNetUnfolderBase]: For 499/501 co-relation queries the response was YES. [2024-10-11 17:06:19,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 455 events. 37/455 cut-off events. For 499/501 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1578 event pairs, 5 based on Foata normal form. 1/446 useless extension candidates. Maximal degree in co-relation 752. Up to 53 conditions per place. [2024-10-11 17:06:19,697 INFO L140 encePairwiseOnDemand]: 85/92 looper letters, 35 selfloop transitions, 34 changer transitions 0/153 dead transitions. [2024-10-11 17:06:19,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 153 transitions, 1011 flow [2024-10-11 17:06:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 17:06:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-11 17:06:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1623 transitions. [2024-10-11 17:06:19,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8400621118012422 [2024-10-11 17:06:19,700 INFO L175 Difference]: Start difference. First operand has 156 places, 146 transitions, 823 flow. Second operand 21 states and 1623 transitions. [2024-10-11 17:06:19,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 153 transitions, 1011 flow [2024-10-11 17:06:19,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 153 transitions, 911 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-10-11 17:06:19,705 INFO L231 Difference]: Finished difference. Result has 172 places, 146 transitions, 860 flow [2024-10-11 17:06:19,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=860, PETRI_PLACES=172, PETRI_TRANSITIONS=146} [2024-10-11 17:06:19,705 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 81 predicate places. [2024-10-11 17:06:19,705 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 146 transitions, 860 flow [2024-10-11 17:06:19,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 77.52941176470588) internal successors, (1318), 17 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:06:19,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:06:19,706 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:06:19,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 17:06:19,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 17:06:19,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 17:06:19,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:06:19,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1843761931, now seen corresponding path program 1 times [2024-10-11 17:06:19,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:06:19,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882562391] [2024-10-11 17:06:19,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:06:19,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:06:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:06:19,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:06:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:06:19,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:06:19,990 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:06:19,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-10-11 17:06:19,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-10-11 17:06:19,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-10-11 17:06:19,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-10-11 17:06:19,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-10-11 17:06:19,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-10-11 17:06:19,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-10-11 17:06:19,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-10-11 17:06:19,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-10-11 17:06:19,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-10-11 17:06:19,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2024-10-11 17:06:19,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-10-11 17:06:19,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-10-11 17:06:19,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-10-11 17:06:19,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-10-11 17:06:19,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:06:19,993 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:06:20,056 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:06:20,056 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:06:20,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:06:20 BasicIcfg [2024-10-11 17:06:20,059 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:06:20,060 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:06:20,060 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:06:20,060 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:06:20,060 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:06:13" (3/4) ... [2024-10-11 17:06:20,061 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 17:06:20,062 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:06:20,062 INFO L158 Benchmark]: Toolchain (without parser) took 7568.79ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 89.3MB in the beginning and 90.2MB in the end (delta: -899.6kB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2024-10-11 17:06:20,062 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:06:20,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.11ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 113.3MB in the end (delta: -24.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-11 17:06:20,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.66ms. Allocated memory is still 159.4MB. Free memory was 113.3MB in the beginning and 111.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:06:20,063 INFO L158 Benchmark]: Boogie Preprocessor took 15.39ms. Allocated memory is still 159.4MB. Free memory was 111.2MB in the beginning and 109.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:06:20,063 INFO L158 Benchmark]: RCFGBuilder took 314.81ms. Allocated memory is still 159.4MB. Free memory was 109.7MB in the beginning and 94.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:06:20,063 INFO L158 Benchmark]: TraceAbstraction took 6737.94ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 93.6MB in the beginning and 91.3MB in the end (delta: 2.3MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2024-10-11 17:06:20,063 INFO L158 Benchmark]: Witness Printer took 2.15ms. Allocated memory is still 247.5MB. Free memory was 91.3MB in the beginning and 90.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:06:20,064 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.11ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 113.3MB in the end (delta: -24.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.66ms. Allocated memory is still 159.4MB. Free memory was 113.3MB in the beginning and 111.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.39ms. Allocated memory is still 159.4MB. Free memory was 111.2MB in the beginning and 109.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.81ms. Allocated memory is still 159.4MB. Free memory was 109.7MB in the beginning and 94.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6737.94ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 93.6MB in the beginning and 91.3MB in the end (delta: 2.3MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. * Witness Printer took 2.15ms. Allocated memory is still 247.5MB. Free memory was 91.3MB in the beginning and 90.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1009]: Data race detected Data race detected The following path leads to a data race: [L987] 0 int glob; VAL [glob=0] [L988] 0 pthread_mutex_t *p, *q; VAL [glob=0, p={0:0}, q={0:0}] [L996] 0 pthread_t t1, t2; VAL [glob=0, p={0:0}, q={0:0}] [L997] 0 int i; VAL [glob=0, p={0:0}, q={0:0}] [L998] 0 pthread_mutex_t *a; VAL [glob=0, p={0:0}, q={0:0}] [L999] 0 i=0 VAL [glob=0, i=0, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, i=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-2:0}, glob=0, i=1, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [a={-2:0}, glob=0, i=1, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-3:0}, glob=0, i=2, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [a={-3:0}, glob=0, i=2, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-4:0}, glob=0, i=3, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [a={-4:0}, glob=0, i=3, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-5:0}, glob=0, i=3, p={0:0}, q={0:0}] [L1002] COND TRUE 0 i==3 VAL [a={-5:0}, glob=0, i=3, p={0:0}, q={0:0}] [L1003] 0 p = a VAL [a={-5:0}, glob=0, i=3, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-5:0}, glob=0, i=3, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-5:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [a={-5:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-6:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [a={-6:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-7:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [a={-7:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-8:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [a={-8:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1004] COND TRUE 0 i==7 VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1005] 0 q = a VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-9:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L999] COND TRUE 0 i < 10 VAL [a={-9:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-10:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L999] COND TRUE 0 i < 10 VAL [a={-10:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}] [L999] COND FALSE 0 !(i < 10) VAL [a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}] [L1007] FCALL, FORK 0 pthread_create(&t1, 0, f, 0) VAL [\old(x)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1] [L1008] 0 pthread_mutex_lock(p) VAL [\old(x)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1] [L990] 1 pthread_mutex_lock(q) VAL [\old(x)={0:0}, glob=0, p={-5:0}, q={-9:0}, x={0:0}] [L991] 1 glob++ VAL [\old(x)={0:0}, glob=0, p={-5:0}, q={-9:0}, x={0:0}] [L1009] 0 glob++ VAL [\old(x)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1, x={0:0}] [L991] 1 glob++ VAL [\old(x)={0:0}, glob=1, p={-5:0}, q={-9:0}, x={0:0}] [L1009] 0 glob++ VAL [\old(x)={0:0}, a={-11:0}, glob=1, i=10, p={-5:0}, q={-9:0}, t1=-1, x={0:0}] Now there is a data race on ~glob~0 between C: glob++ [991] and C: glob++ [1009] - UnprovableResult [Line: 990]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 991]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 991]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 992]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 115 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: 6.6s, OverallIterations: 14, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 399 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 881 IncrementalHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 102 mSDtfsCounter, 881 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1034 GetRequests, 903 SyntacticMatches, 10 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=13, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1400 NumberOfCodeBlocks, 1400 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1574 ConstructedInterpolants, 0 QuantifiedInterpolants, 2822 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1509 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 1038/1596 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 17:06:20,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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