./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/airline-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/airline-10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e894693d2d051395e42cf40effac907db7b5be7a8f5722374b3e5b36cc0228a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:01:23,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:01:23,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 10:01:23,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:01:23,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:01:23,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:01:23,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:01:23,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:01:23,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:01:23,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:01:23,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:01:23,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:01:23,318 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:01:23,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:01:23,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:01:23,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:01:23,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:01:23,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:01:23,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:01:23,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:01:23,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:01:23,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:01:23,325 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 10:01:23,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:01:23,325 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:01:23,325 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:01:23,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:01:23,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:01:23,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:01:23,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:01:23,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:01:23,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:01:23,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:01:23,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:01:23,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 10:01:23,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:01:23,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:01:23,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:01:23,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:01:23,329 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:01:23,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:01:23,330 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e894693d2d051395e42cf40effac907db7b5be7a8f5722374b3e5b36cc0228a [2024-10-13 10:01:23,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:01:23,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:01:23,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:01:23,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:01:23,566 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:01:23,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/airline-10.i [2024-10-13 10:01:24,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:01:25,061 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:01:25,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/airline-10.i [2024-10-13 10:01:25,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b15881eb/816ca33d489f49c394e64ba7560fbc00/FLAGd8abdba62 [2024-10-13 10:01:25,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b15881eb/816ca33d489f49c394e64ba7560fbc00 [2024-10-13 10:01:25,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:01:25,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:01:25,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:01:25,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:01:25,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:01:25,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1815e825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25, skipping insertion in model container [2024-10-13 10:01:25,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:01:25,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:01:25,806 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:01:25,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:01:25,885 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:01:25,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25 WrapperNode [2024-10-13 10:01:25,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:01:25,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:01:25,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:01:25,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:01:25,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,930 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2024-10-13 10:01:25,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:01:25,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:01:25,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:01:25,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:01:25,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:01:25,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:01:25,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:01:25,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:01:25,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (1/1) ... [2024-10-13 10:01:25,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:01:25,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:01:26,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:01:26,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:01:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 10:01:26,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 10:01:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 10:01:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:01:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:01:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2024-10-13 10:01:26,050 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2024-10-13 10:01:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:01:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 10:01:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 10:01:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:01:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:01:26,052 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 10:01:26,151 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:01:26,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:01:26,339 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 10:01:26,339 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:01:26,376 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:01:26,376 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:01:26,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:01:26 BoogieIcfgContainer [2024-10-13 10:01:26,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:01:26,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:01:26,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:01:26,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:01:26,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:01:25" (1/3) ... [2024-10-13 10:01:26,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acbe472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:01:26, skipping insertion in model container [2024-10-13 10:01:26,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:01:25" (2/3) ... [2024-10-13 10:01:26,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acbe472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:01:26, skipping insertion in model container [2024-10-13 10:01:26,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:01:26" (3/3) ... [2024-10-13 10:01:26,385 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-10.i [2024-10-13 10:01:26,399 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:01:26,399 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-13 10:01:26,399 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 10:01:26,444 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-13 10:01:26,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 99 transitions, 205 flow [2024-10-13 10:01:26,533 INFO L124 PetriNetUnfolderBase]: 11/144 cut-off events. [2024-10-13 10:01:26,533 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 10:01:26,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 144 events. 11/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 307 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 70. Up to 4 conditions per place. [2024-10-13 10:01:26,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 99 transitions, 205 flow [2024-10-13 10:01:26,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 99 transitions, 205 flow [2024-10-13 10:01:26,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:01:26,562 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;@5e693ea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:01:26,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-13 10:01:26,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:01:26,569 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-10-13 10:01:26,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:01:26,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:26,570 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:26,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-13 10:01:26,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:26,577 INFO L85 PathProgramCache]: Analyzing trace with hash -694234630, now seen corresponding path program 1 times [2024-10-13 10:01:26,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:26,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081560184] [2024-10-13 10:01:26,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:26,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:26,736 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-13 10:01:26,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:26,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081560184] [2024-10-13 10:01:26,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081560184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:26,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:26,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:01:26,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821886317] [2024-10-13 10:01:26,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:26,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:01:26,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:26,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:01:26,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:01:26,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 99 [2024-10-13 10:01:26,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 99 transitions, 205 flow. Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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-13 10:01:26,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:26,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 99 [2024-10-13 10:01:26,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:26,821 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events. [2024-10-13 10:01:26,821 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-13 10:01:26,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 3/127 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 253 event pairs, 0 based on Foata normal form. 10/121 useless extension candidates. Maximal degree in co-relation 64. Up to 8 conditions per place. [2024-10-13 10:01:26,823 INFO L140 encePairwiseOnDemand]: 90/99 looper letters, 7 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2024-10-13 10:01:26,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 197 flow [2024-10-13 10:01:26,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:01:26,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 10:01:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions. [2024-10-13 10:01:26,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2024-10-13 10:01:26,837 INFO L175 Difference]: Start difference. First operand has 95 places, 99 transitions, 205 flow. Second operand 2 states and 180 transitions. [2024-10-13 10:01:26,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 197 flow [2024-10-13 10:01:26,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:01:26,858 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 183 flow [2024-10-13 10:01:26,859 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=183, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2024-10-13 10:01:26,870 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places. [2024-10-13 10:01:26,871 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 183 flow [2024-10-13 10:01:26,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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-13 10:01:26,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:26,871 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:26,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:01:26,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-13 10:01:26,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:26,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1899843324, now seen corresponding path program 1 times [2024-10-13 10:01:26,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:26,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775064687] [2024-10-13 10:01:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:26,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:26,992 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-13 10:01:26,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:26,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775064687] [2024-10-13 10:01:26,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775064687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:26,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:26,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:01:26,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375914267] [2024-10-13 10:01:26,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:26,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:26,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:26,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:26,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:27,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 99 [2024-10-13 10:01:27,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 183 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-13 10:01:27,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:27,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 99 [2024-10-13 10:01:27,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:27,075 INFO L124 PetriNetUnfolderBase]: 10/174 cut-off events. [2024-10-13 10:01:27,075 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 10:01:27,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 174 events. 10/174 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 441 event pairs, 0 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 203. Up to 23 conditions per place. [2024-10-13 10:01:27,077 INFO L140 encePairwiseOnDemand]: 96/99 looper letters, 13 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-10-13 10:01:27,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 217 flow [2024-10-13 10:01:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2024-10-13 10:01:27,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8215488215488216 [2024-10-13 10:01:27,079 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 183 flow. Second operand 3 states and 244 transitions. [2024-10-13 10:01:27,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 217 flow [2024-10-13 10:01:27,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:01:27,082 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 191 flow [2024-10-13 10:01:27,082 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2024-10-13 10:01:27,083 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2024-10-13 10:01:27,083 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 191 flow [2024-10-13 10:01:27,084 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-13 10:01:27,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:27,084 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] [2024-10-13 10:01:27,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:01:27,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-13 10:01:27,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:27,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1901875597, now seen corresponding path program 1 times [2024-10-13 10:01:27,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:27,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860187586] [2024-10-13 10:01:27,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:27,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:27,472 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-13 10:01:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:27,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860187586] [2024-10-13 10:01:27,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860187586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:27,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:27,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:01:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273072880] [2024-10-13 10:01:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:27,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:01:27,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:27,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:01:27,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:01:27,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 99 [2024-10-13 10:01:27,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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-13 10:01:27,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:27,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 99 [2024-10-13 10:01:27,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:27,632 INFO L124 PetriNetUnfolderBase]: 33/198 cut-off events. [2024-10-13 10:01:27,633 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-13 10:01:27,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 198 events. 33/198 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 653 event pairs, 9 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 292. Up to 56 conditions per place. [2024-10-13 10:01:27,634 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 28 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2024-10-13 10:01:27,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 271 flow [2024-10-13 10:01:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:01:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:01:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2024-10-13 10:01:27,637 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6936026936026936 [2024-10-13 10:01:27,637 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 191 flow. Second operand 6 states and 412 transitions. [2024-10-13 10:01:27,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 271 flow [2024-10-13 10:01:27,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 95 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:27,639 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 195 flow [2024-10-13 10:01:27,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2024-10-13 10:01:27,640 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2024-10-13 10:01:27,640 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 195 flow [2024-10-13 10:01:27,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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-13 10:01:27,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:27,640 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] [2024-10-13 10:01:27,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:01:27,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-13 10:01:27,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:27,641 INFO L85 PathProgramCache]: Analyzing trace with hash -517437541, now seen corresponding path program 1 times [2024-10-13 10:01:27,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:27,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568168380] [2024-10-13 10:01:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:27,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:27,663 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-13 10:01:27,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:27,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568168380] [2024-10-13 10:01:27,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568168380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:27,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:27,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:27,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063220944] [2024-10-13 10:01:27,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:27,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:27,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:27,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:27,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:27,667 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 99 [2024-10-13 10:01:27,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-13 10:01:27,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:27,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 99 [2024-10-13 10:01:27,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:27,688 INFO L124 PetriNetUnfolderBase]: 1/154 cut-off events. [2024-10-13 10:01:27,688 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2024-10-13 10:01:27,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 154 events. 1/154 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 309 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 179. Up to 7 conditions per place. [2024-10-13 10:01:27,689 INFO L140 encePairwiseOnDemand]: 96/99 looper letters, 8 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2024-10-13 10:01:27,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 87 transitions, 218 flow [2024-10-13 10:01:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-10-13 10:01:27,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.835016835016835 [2024-10-13 10:01:27,691 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 195 flow. Second operand 3 states and 248 transitions. [2024-10-13 10:01:27,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 87 transitions, 218 flow [2024-10-13 10:01:27,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 87 transitions, 208 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:27,693 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 187 flow [2024-10-13 10:01:27,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2024-10-13 10:01:27,694 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2024-10-13 10:01:27,694 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 187 flow [2024-10-13 10:01:27,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-13 10:01:27,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:27,694 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] [2024-10-13 10:01:27,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:01:27,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-13 10:01:27,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash -343848704, now seen corresponding path program 1 times [2024-10-13 10:01:27,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:27,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596757594] [2024-10-13 10:01:27,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:27,721 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-13 10:01:27,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:27,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596757594] [2024-10-13 10:01:27,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596757594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:27,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:27,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:27,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409095305] [2024-10-13 10:01:27,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:27,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:27,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:27,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:27,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:27,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 99 [2024-10-13 10:01:27,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-13 10:01:27,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:27,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 99 [2024-10-13 10:01:27,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:27,772 INFO L124 PetriNetUnfolderBase]: 8/228 cut-off events. [2024-10-13 10:01:27,773 INFO L125 PetriNetUnfolderBase]: For 10/18 co-relation queries the response was YES. [2024-10-13 10:01:27,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 228 events. 8/228 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 817 event pairs, 4 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 272. Up to 25 conditions per place. [2024-10-13 10:01:27,774 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 12 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2024-10-13 10:01:27,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 228 flow [2024-10-13 10:01:27,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2024-10-13 10:01:27,775 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8282828282828283 [2024-10-13 10:01:27,775 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 187 flow. Second operand 3 states and 246 transitions. [2024-10-13 10:01:27,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 228 flow [2024-10-13 10:01:27,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:27,777 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 211 flow [2024-10-13 10:01:27,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2024-10-13 10:01:27,778 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2024-10-13 10:01:27,778 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 211 flow [2024-10-13 10:01:27,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-13 10:01:27,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:27,779 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-13 10:01:27,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:01:27,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-13 10:01:27,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:27,779 INFO L85 PathProgramCache]: Analyzing trace with hash -773710453, now seen corresponding path program 1 times [2024-10-13 10:01:27,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:27,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260916565] [2024-10-13 10:01:27,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:27,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:27,856 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-13 10:01:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:27,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260916565] [2024-10-13 10:01:27,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260916565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:01:27,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822757960] [2024-10-13 10:01:27,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:27,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:01:27,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:01:27,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:01:27,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:01:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:27,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:01:27,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:01:27,983 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-13 10:01:27,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:01:28,025 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-13 10:01:28,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822757960] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:01:28,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:01:28,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-13 10:01:28,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583131623] [2024-10-13 10:01:28,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:01:28,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:01:28,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:28,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:01:28,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:01:28,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 99 [2024-10-13 10:01:28,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 211 flow. Second operand has 10 states, 10 states have (on average 75.4) internal successors, (754), 10 states have internal predecessors, (754), 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-13 10:01:28,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:28,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 99 [2024-10-13 10:01:28,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:28,154 INFO L124 PetriNetUnfolderBase]: 9/101 cut-off events. [2024-10-13 10:01:28,155 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-13 10:01:28,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 101 events. 9/101 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 194 event pairs, 0 based on Foata normal form. 3/100 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2024-10-13 10:01:28,156 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 15 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-10-13 10:01:28,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 182 flow [2024-10-13 10:01:28,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:01:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:01:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 458 transitions. [2024-10-13 10:01:28,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7710437710437711 [2024-10-13 10:01:28,157 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 211 flow. Second operand 6 states and 458 transitions. [2024-10-13 10:01:28,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 182 flow [2024-10-13 10:01:28,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 59 transitions, 160 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:28,158 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 116 flow [2024-10-13 10:01:28,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2024-10-13 10:01:28,159 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -36 predicate places. [2024-10-13 10:01:28,159 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 116 flow [2024-10-13 10:01:28,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.4) internal successors, (754), 10 states have internal predecessors, (754), 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-13 10:01:28,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:28,160 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:28,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:01:28,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 10:01:28,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-13 10:01:28,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:28,366 INFO L85 PathProgramCache]: Analyzing trace with hash -542448446, now seen corresponding path program 1 times [2024-10-13 10:01:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:28,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682787522] [2024-10-13 10:01:28,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:28,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:01:28,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 10:01:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:01:28,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 10:01:28,421 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 10:01:28,423 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-10-13 10:01:28,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-10-13 10:01:28,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-10-13 10:01:28,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-10-13 10:01:28,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-10-13 10:01:28,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-10-13 10:01:28,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-10-13 10:01:28,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-10-13 10:01:28,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-10-13 10:01:28,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-10-13 10:01:28,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-10-13 10:01:28,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-10-13 10:01:28,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-10-13 10:01:28,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-10-13 10:01:28,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-10-13 10:01:28,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:01:28,428 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:28,430 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 10:01:28,430 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-13 10:01:28,449 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 10:01:28,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 120 transitions, 256 flow [2024-10-13 10:01:28,472 INFO L124 PetriNetUnfolderBase]: 22/256 cut-off events. [2024-10-13 10:01:28,474 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-13 10:01:28,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 256 events. 22/256 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 600 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2024-10-13 10:01:28,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 120 transitions, 256 flow [2024-10-13 10:01:28,479 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 120 transitions, 256 flow [2024-10-13 10:01:28,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:01:28,480 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;@5e693ea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:01:28,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-10-13 10:01:28,482 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:01:28,483 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-10-13 10:01:28,483 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:01:28,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:28,483 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:28,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-10-13 10:01:28,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:28,484 INFO L85 PathProgramCache]: Analyzing trace with hash 424036858, now seen corresponding path program 1 times [2024-10-13 10:01:28,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:28,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775918954] [2024-10-13 10:01:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:28,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:28,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775918954] [2024-10-13 10:01:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775918954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:28,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:28,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:01:28,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077821238] [2024-10-13 10:01:28,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:28,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:01:28,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:28,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:01:28,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:01:28,499 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2024-10-13 10:01:28,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 120 transitions, 256 flow. Second operand has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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-13 10:01:28,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:28,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2024-10-13 10:01:28,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:28,536 INFO L124 PetriNetUnfolderBase]: 19/254 cut-off events. [2024-10-13 10:01:28,536 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2024-10-13 10:01:28,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 254 events. 19/254 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 732 event pairs, 4 based on Foata normal form. 26/246 useless extension candidates. Maximal degree in co-relation 144. Up to 30 conditions per place. [2024-10-13 10:01:28,539 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 11 selfloop transitions, 0 changer transitions 0/107 dead transitions. [2024-10-13 10:01:28,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 252 flow [2024-10-13 10:01:28,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:01:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 10:01:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 216 transitions. [2024-10-13 10:01:28,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9 [2024-10-13 10:01:28,542 INFO L175 Difference]: Start difference. First operand has 115 places, 120 transitions, 256 flow. Second operand 2 states and 216 transitions. [2024-10-13 10:01:28,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 252 flow [2024-10-13 10:01:28,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 107 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:01:28,545 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 230 flow [2024-10-13 10:01:28,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=230, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2024-10-13 10:01:28,545 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -8 predicate places. [2024-10-13 10:01:28,546 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 230 flow [2024-10-13 10:01:28,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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-13 10:01:28,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:28,546 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:28,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:01:28,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-10-13 10:01:28,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1451332092, now seen corresponding path program 1 times [2024-10-13 10:01:28,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:28,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104712626] [2024-10-13 10:01:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:28,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:28,584 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-13 10:01:28,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:28,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104712626] [2024-10-13 10:01:28,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104712626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:28,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:28,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:01:28,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514241953] [2024-10-13 10:01:28,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:28,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:28,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:28,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2024-10-13 10:01:28,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-13 10:01:28,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:28,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2024-10-13 10:01:28,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:28,687 INFO L124 PetriNetUnfolderBase]: 60/451 cut-off events. [2024-10-13 10:01:28,688 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-10-13 10:01:28,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 451 events. 60/451 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2086 event pairs, 24 based on Foata normal form. 1/395 useless extension candidates. Maximal degree in co-relation 568. Up to 97 conditions per place. [2024-10-13 10:01:28,690 INFO L140 encePairwiseOnDemand]: 117/120 looper letters, 18 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2024-10-13 10:01:28,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 110 transitions, 276 flow [2024-10-13 10:01:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2024-10-13 10:01:28,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2024-10-13 10:01:28,691 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 230 flow. Second operand 3 states and 294 transitions. [2024-10-13 10:01:28,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 110 transitions, 276 flow [2024-10-13 10:01:28,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:01:28,693 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 242 flow [2024-10-13 10:01:28,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-10-13 10:01:28,694 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2024-10-13 10:01:28,694 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 242 flow [2024-10-13 10:01:28,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-13 10:01:28,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:28,695 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] [2024-10-13 10:01:28,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:01:28,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-10-13 10:01:28,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:28,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1947140101, now seen corresponding path program 1 times [2024-10-13 10:01:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:28,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652724221] [2024-10-13 10:01:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:28,848 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-13 10:01:28,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:28,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652724221] [2024-10-13 10:01:28,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652724221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:28,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:28,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:01:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216616660] [2024-10-13 10:01:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:28,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:01:28,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:28,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:01:28,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:01:28,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 120 [2024-10-13 10:01:28,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-13 10:01:28,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:28,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 120 [2024-10-13 10:01:28,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:29,055 INFO L124 PetriNetUnfolderBase]: 185/628 cut-off events. [2024-10-13 10:01:29,055 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-10-13 10:01:29,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 628 events. 185/628 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3492 event pairs, 55 based on Foata normal form. 0/568 useless extension candidates. Maximal degree in co-relation 974. Up to 214 conditions per place. [2024-10-13 10:01:29,060 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 41 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2024-10-13 10:01:29,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 123 transitions, 364 flow [2024-10-13 10:01:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:01:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:01:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2024-10-13 10:01:29,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7138888888888889 [2024-10-13 10:01:29,062 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 242 flow. Second operand 6 states and 514 transitions. [2024-10-13 10:01:29,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 123 transitions, 364 flow [2024-10-13 10:01:29,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:01:29,064 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 248 flow [2024-10-13 10:01:29,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2024-10-13 10:01:29,066 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -2 predicate places. [2024-10-13 10:01:29,067 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 248 flow [2024-10-13 10:01:29,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-13 10:01:29,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:29,067 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] [2024-10-13 10:01:29,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:01:29,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-10-13 10:01:29,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:29,068 INFO L85 PathProgramCache]: Analyzing trace with hash -709870816, now seen corresponding path program 1 times [2024-10-13 10:01:29,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:29,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661255586] [2024-10-13 10:01:29,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:29,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:29,090 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-13 10:01:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661255586] [2024-10-13 10:01:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661255586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:29,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647572111] [2024-10-13 10:01:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:29,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:29,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:29,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:29,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:29,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2024-10-13 10:01:29,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:01:29,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:29,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2024-10-13 10:01:29,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:29,189 INFO L124 PetriNetUnfolderBase]: 60/772 cut-off events. [2024-10-13 10:01:29,189 INFO L125 PetriNetUnfolderBase]: For 122/386 co-relation queries the response was YES. [2024-10-13 10:01:29,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 772 events. 60/772 cut-off events. For 122/386 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5064 event pairs, 9 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 951. Up to 62 conditions per place. [2024-10-13 10:01:29,194 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 22 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2024-10-13 10:01:29,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 118 transitions, 337 flow [2024-10-13 10:01:29,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2024-10-13 10:01:29,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2024-10-13 10:01:29,195 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 248 flow. Second operand 3 states and 303 transitions. [2024-10-13 10:01:29,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 118 transitions, 337 flow [2024-10-13 10:01:29,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 327 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:29,200 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 290 flow [2024-10-13 10:01:29,200 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2024-10-13 10:01:29,201 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2024-10-13 10:01:29,201 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 290 flow [2024-10-13 10:01:29,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:01:29,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:29,202 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] [2024-10-13 10:01:29,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:01:29,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-10-13 10:01:29,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash 657915091, now seen corresponding path program 1 times [2024-10-13 10:01:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:29,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912626456] [2024-10-13 10:01:29,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:29,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:29,227 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-13 10:01:29,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:29,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912626456] [2024-10-13 10:01:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912626456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:29,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:29,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333533957] [2024-10-13 10:01:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:29,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:29,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:29,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:29,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:29,239 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 120 [2024-10-13 10:01:29,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:01:29,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:29,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 120 [2024-10-13 10:01:29,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:29,404 INFO L124 PetriNetUnfolderBase]: 273/1920 cut-off events. [2024-10-13 10:01:29,405 INFO L125 PetriNetUnfolderBase]: For 374/820 co-relation queries the response was YES. [2024-10-13 10:01:29,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1920 events. 273/1920 cut-off events. For 374/820 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16766 event pairs, 93 based on Foata normal form. 1/1652 useless extension candidates. Maximal degree in co-relation 2702. Up to 395 conditions per place. [2024-10-13 10:01:29,416 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 27 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2024-10-13 10:01:29,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 126 transitions, 405 flow [2024-10-13 10:01:29,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2024-10-13 10:01:29,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-10-13 10:01:29,418 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 290 flow. Second operand 3 states and 300 transitions. [2024-10-13 10:01:29,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 126 transitions, 405 flow [2024-10-13 10:01:29,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 126 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:29,421 INFO L231 Difference]: Finished difference. Result has 114 places, 121 transitions, 348 flow [2024-10-13 10:01:29,422 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=114, PETRI_TRANSITIONS=121} [2024-10-13 10:01:29,423 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -1 predicate places. [2024-10-13 10:01:29,423 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 121 transitions, 348 flow [2024-10-13 10:01:29,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:01:29,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:29,423 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-13 10:01:29,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:01:29,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-10-13 10:01:29,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:29,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1536806754, now seen corresponding path program 1 times [2024-10-13 10:01:29,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:29,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572927506] [2024-10-13 10:01:29,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:29,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:29,511 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-13 10:01:29,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:29,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572927506] [2024-10-13 10:01:29,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572927506] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:01:29,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556936761] [2024-10-13 10:01:29,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:29,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:01:29,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:01:29,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:01:29,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:01:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:29,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:01:29,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:01:29,629 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-13 10:01:29,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:01:29,674 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-13 10:01:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556936761] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:01:29,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:01:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-13 10:01:29,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673881404] [2024-10-13 10:01:29,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:01:29,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:01:29,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:29,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:01:29,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:01:29,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 120 [2024-10-13 10:01:29,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 121 transitions, 348 flow. Second operand has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 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-13 10:01:29,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:29,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 120 [2024-10-13 10:01:29,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:29,894 INFO L124 PetriNetUnfolderBase]: 168/824 cut-off events. [2024-10-13 10:01:29,894 INFO L125 PetriNetUnfolderBase]: For 366/427 co-relation queries the response was YES. [2024-10-13 10:01:29,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 824 events. 168/824 cut-off events. For 366/427 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5933 event pairs, 5 based on Foata normal form. 37/806 useless extension candidates. Maximal degree in co-relation 1449. Up to 104 conditions per place. [2024-10-13 10:01:29,900 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 47 selfloop transitions, 7 changer transitions 0/119 dead transitions. [2024-10-13 10:01:29,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 119 transitions, 508 flow [2024-10-13 10:01:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:01:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 10:01:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 832 transitions. [2024-10-13 10:01:29,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7703703703703704 [2024-10-13 10:01:29,903 INFO L175 Difference]: Start difference. First operand has 114 places, 121 transitions, 348 flow. Second operand 9 states and 832 transitions. [2024-10-13 10:01:29,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 119 transitions, 508 flow [2024-10-13 10:01:29,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 119 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:29,906 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 260 flow [2024-10-13 10:01:29,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=260, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2024-10-13 10:01:29,906 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -27 predicate places. [2024-10-13 10:01:29,906 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 260 flow [2024-10-13 10:01:29,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.4) internal successors, (904), 10 states have internal predecessors, (904), 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-13 10:01:29,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:29,907 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:29,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:01:30,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 10:01:30,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-10-13 10:01:30,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:30,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1661324039, now seen corresponding path program 1 times [2024-10-13 10:01:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:30,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56282139] [2024-10-13 10:01:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 10:01:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:30,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56282139] [2024-10-13 10:01:30,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56282139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:30,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:30,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:01:30,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746810422] [2024-10-13 10:01:30,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:30,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:01:30,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:30,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:01:30,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:01:30,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2024-10-13 10:01:30,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:01:30,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:30,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2024-10-13 10:01:30,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:30,222 INFO L124 PetriNetUnfolderBase]: 28/295 cut-off events. [2024-10-13 10:01:30,223 INFO L125 PetriNetUnfolderBase]: For 44/46 co-relation queries the response was YES. [2024-10-13 10:01:30,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 295 events. 28/295 cut-off events. For 44/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1438 event pairs, 4 based on Foata normal form. 7/284 useless extension candidates. Maximal degree in co-relation 461. Up to 29 conditions per place. [2024-10-13 10:01:30,225 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 23 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2024-10-13 10:01:30,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 97 transitions, 363 flow [2024-10-13 10:01:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:01:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 10:01:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2024-10-13 10:01:30,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8216666666666667 [2024-10-13 10:01:30,226 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 260 flow. Second operand 5 states and 493 transitions. [2024-10-13 10:01:30,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 97 transitions, 363 flow [2024-10-13 10:01:30,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 97 transitions, 348 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:30,228 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 280 flow [2024-10-13 10:01:30,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2024-10-13 10:01:30,229 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -26 predicate places. [2024-10-13 10:01:30,229 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 280 flow [2024-10-13 10:01:30,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:01:30,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:30,229 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:30,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:01:30,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-10-13 10:01:30,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash 659768417, now seen corresponding path program 1 times [2024-10-13 10:01:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:30,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692674772] [2024-10-13 10:01:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 10:01:30,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:30,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692674772] [2024-10-13 10:01:30,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692674772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:30,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:30,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:01:30,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860063535] [2024-10-13 10:01:30,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:30,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:01:30,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:01:30,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:01:30,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2024-10-13 10:01:30,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:01:30,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:30,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2024-10-13 10:01:30,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:30,338 INFO L124 PetriNetUnfolderBase]: 22/261 cut-off events. [2024-10-13 10:01:30,338 INFO L125 PetriNetUnfolderBase]: For 108/116 co-relation queries the response was YES. [2024-10-13 10:01:30,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 261 events. 22/261 cut-off events. For 108/116 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1072 event pairs, 4 based on Foata normal form. 12/264 useless extension candidates. Maximal degree in co-relation 449. Up to 33 conditions per place. [2024-10-13 10:01:30,340 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 19 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2024-10-13 10:01:30,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 94 transitions, 361 flow [2024-10-13 10:01:30,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:01:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 10:01:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2024-10-13 10:01:30,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.815 [2024-10-13 10:01:30,342 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 280 flow. Second operand 5 states and 489 transitions. [2024-10-13 10:01:30,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 94 transitions, 361 flow [2024-10-13 10:01:30,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 94 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:01:30,344 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 314 flow [2024-10-13 10:01:30,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-10-13 10:01:30,345 INFO L277 CegarLoopForPetriNet]: 115 programPoint places, -21 predicate places. [2024-10-13 10:01:30,345 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 314 flow [2024-10-13 10:01:30,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:01:30,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:30,346 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:30,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:01:30,346 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2024-10-13 10:01:30,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1201801134, now seen corresponding path program 1 times [2024-10-13 10:01:30,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:30,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036116104] [2024-10-13 10:01:30,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:30,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:01:30,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 10:01:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:01:30,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 10:01:30,400 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 10:01:30,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2024-10-13 10:01:30,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2024-10-13 10:01:30,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2024-10-13 10:01:30,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2024-10-13 10:01:30,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2024-10-13 10:01:30,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2024-10-13 10:01:30,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2024-10-13 10:01:30,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2024-10-13 10:01:30,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2024-10-13 10:01:30,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2024-10-13 10:01:30,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2024-10-13 10:01:30,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 19 remaining) [2024-10-13 10:01:30,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2024-10-13 10:01:30,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2024-10-13 10:01:30,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2024-10-13 10:01:30,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2024-10-13 10:01:30,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2024-10-13 10:01:30,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2024-10-13 10:01:30,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2024-10-13 10:01:30,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:01:30,403 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:30,469 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-10-13 10:01:30,469 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:01:30,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:01:30 BasicIcfg [2024-10-13 10:01:30,474 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:01:30,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:01:30,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:01:30,475 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:01:30,475 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:01:26" (3/4) ... [2024-10-13 10:01:30,477 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 10:01:30,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:01:30,478 INFO L158 Benchmark]: Toolchain (without parser) took 5035.75ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 92.2MB in the beginning and 222.3MB in the end (delta: -130.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:01:30,478 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:01:30,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.45ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 122.5MB in the end (delta: -30.5MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-10-13 10:01:30,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.82ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:01:30,479 INFO L158 Benchmark]: Boogie Preprocessor took 45.40ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 119.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:01:30,479 INFO L158 Benchmark]: RCFGBuilder took 400.12ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 99.5MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 10:01:30,479 INFO L158 Benchmark]: TraceAbstraction took 4095.37ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 99.5MB in the beginning and 223.4MB in the end (delta: -123.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:01:30,479 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 274.7MB. Free memory was 223.4MB in the beginning and 222.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:01:30,481 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.45ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 122.5MB in the end (delta: -30.5MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.82ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.40ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 119.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.12ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 99.5MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4095.37ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 99.5MB in the beginning and 223.4MB in the end (delta: -123.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 274.7MB. Free memory was 223.4MB in the beginning and 222.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, numberOfSeatsSold=0, stopSales=0] [L736] 0 pthread_t salethreads[10]; VAL [\old(argc)=50, \old(argv)={54:51}, argc=50, numOfTickets=0, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L738] 0 numOfTickets = 10 VAL [\old(argc)=50, \old(argv)={54:51}, argc=50, numOfTickets=10, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=50, \old(argv)={54:51}, argc=50, numOfTickets=10, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=50, \old(argv)={54:51}, argc=50, numOfTickets=10, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=50, \old(argv)={54:51}, argc=50, i=0, numOfTickets=10, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 10 VAL [\old(argc)=50, \old(argv)={54:51}, argc=50, i=0, numOfTickets=10, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=50, \old(argv)={54:51}, argc=50, i=0, numOfTickets=10, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=50, \old(argv)={54:51}, argc=50, i=0, numOfTickets=10, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L746] 0 i++ VAL [\old(arg)={0:0}, \old(argc)=50, \old(argv)={54:51}, arg={0:0}, argc=50, i=1, numOfTickets=10, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 10 VAL [\old(arg)={0:0}, \old(argc)=50, \old(argv)={54:51}, arg={0:0}, argc=50, i=1, numOfTickets=10, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=50, \old(argv)={54:51}, arg={0:0}, argc=50, i=1, numOfTickets=10, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=50, \old(argv)={54:51}, arg={0:0}, argc=50, i=1, numOfTickets=10, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (10 - (((10 / 10) == 0) ? 1 : (10 / 10)))) VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=10, numberOfSeatsSold=0, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=10, numberOfSeatsSold=1, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=10, numberOfSeatsSold=1, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: 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, 111 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: 2.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 356 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 9 mSDtfsCounter, 356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 499 SizeOfPredicates, 2 NumberOfNonLiveVariables, 127 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 129 locations, 19 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 596 IncrementalHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 16 mSDtfsCounter, 596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 775 SizeOfPredicates, 2 NumberOfNonLiveVariables, 127 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 22/25 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-13 10:01:30,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE