./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.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 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:58:15,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:58:15,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:58:15,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:58:15,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:58:15,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:58:15,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:58:15,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:58:15,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:58:15,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:58:15,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:58:15,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:58:15,651 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:58:15,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:58:15,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:58:15,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:58:15,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:58:15,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:58:15,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:58:15,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:58:15,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:58:15,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:58:15,656 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:58:15,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:58:15,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:58:15,658 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:58:15,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:58:15,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:58:15,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:58:15,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:58:15,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:58:15,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:58:15,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:58:15,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:58:15,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:58:15,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:58:15,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:58:15,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:58:15,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:58:15,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:58:15,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:58:15,665 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 -> 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 [2024-11-09 06:58:15,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:58:15,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:58:15,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:58:15,955 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:58:15,955 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:58:15,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2024-11-09 06:58:17,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:58:17,764 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:58:17,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2024-11-09 06:58:17,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e524616a1/0b89848dee0e46588377fd890ec2691d/FLAGfd32ba03c [2024-11-09 06:58:17,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e524616a1/0b89848dee0e46588377fd890ec2691d [2024-11-09 06:58:17,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:58:17,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:58:17,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:58:17,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:58:17,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:58:17,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:58:17" (1/1) ... [2024-11-09 06:58:17,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a48a1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:17, skipping insertion in model container [2024-11-09 06:58:17,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:58:17" (1/1) ... [2024-11-09 06:58:17,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:58:18,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:58:18,312 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:58:18,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:58:18,398 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:58:18,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18 WrapperNode [2024-11-09 06:58:18,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:58:18,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:58:18,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:58:18,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:58:18,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (1/1) ... [2024-11-09 06:58:18,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (1/1) ... [2024-11-09 06:58:18,460 INFO L138 Inliner]: procedures = 165, calls = 47, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 198 [2024-11-09 06:58:18,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:58:18,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:58:18,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:58:18,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:58:18,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (1/1) ... [2024-11-09 06:58:18,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (1/1) ... [2024-11-09 06:58:18,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (1/1) ... [2024-11-09 06:58:18,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (1/1) ... [2024-11-09 06:58:18,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (1/1) ... [2024-11-09 06:58:18,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (1/1) ... [2024-11-09 06:58:18,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (1/1) ... [2024-11-09 06:58:18,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (1/1) ... [2024-11-09 06:58:18,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:58:18,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:58:18,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:58:18,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:58:18,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (1/1) ... [2024-11-09 06:58:18,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:58:18,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:58:18,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:58:18,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:58:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:58:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:58:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:58:18,598 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:58:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:58:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:58:18,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:58:18,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:58:18,601 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:58:18,738 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:58:18,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:58:19,080 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:58:19,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:58:19,129 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:58:19,129 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:58:19,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:19 BoogieIcfgContainer [2024-11-09 06:58:19,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:58:19,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:58:19,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:58:19,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:58:19,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:58:17" (1/3) ... [2024-11-09 06:58:19,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2374a759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:58:19, skipping insertion in model container [2024-11-09 06:58:19,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:18" (2/3) ... [2024-11-09 06:58:19,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2374a759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:58:19, skipping insertion in model container [2024-11-09 06:58:19,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:19" (3/3) ... [2024-11-09 06:58:19,136 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2024-11-09 06:58:19,149 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:58:19,150 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-09 06:58:19,150 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:58:19,252 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:58:19,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 237 transitions, 478 flow [2024-11-09 06:58:19,430 INFO L124 PetriNetUnfolderBase]: 11/240 cut-off events. [2024-11-09 06:58:19,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:58:19,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 240 events. 11/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 273 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 193. Up to 2 conditions per place. [2024-11-09 06:58:19,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 237 transitions, 478 flow [2024-11-09 06:58:19,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 235 transitions, 473 flow [2024-11-09 06:58:19,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:58:19,472 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;@3bd63bae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:58:19,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-09 06:58:19,490 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:58:19,493 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2024-11-09 06:58:19,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:58:19,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:19,494 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:19,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 06:58:19,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2069921328, now seen corresponding path program 1 times [2024-11-09 06:58:19,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:19,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854181037] [2024-11-09 06:58:19,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:19,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:19,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:19,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854181037] [2024-11-09 06:58:19,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854181037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:19,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480475921] [2024-11-09 06:58:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:19,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:19,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:19,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:19,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:19,915 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 237 [2024-11-09 06:58:19,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 235 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:19,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:19,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 237 [2024-11-09 06:58:19,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:20,289 INFO L124 PetriNetUnfolderBase]: 122/1316 cut-off events. [2024-11-09 06:58:20,289 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:58:20,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 1316 events. 122/1316 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7799 event pairs, 87 based on Foata normal form. 112/1278 useless extension candidates. Maximal degree in co-relation 1541. Up to 236 conditions per place. [2024-11-09 06:58:20,307 INFO L140 encePairwiseOnDemand]: 221/237 looper letters, 30 selfloop transitions, 5 changer transitions 0/229 dead transitions. [2024-11-09 06:58:20,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 229 transitions, 531 flow [2024-11-09 06:58:20,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2024-11-09 06:58:20,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9156118143459916 [2024-11-09 06:58:20,332 INFO L175 Difference]: Start difference. First operand has 228 places, 235 transitions, 473 flow. Second operand 3 states and 651 transitions. [2024-11-09 06:58:20,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 229 transitions, 531 flow [2024-11-09 06:58:20,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 229 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:20,345 INFO L231 Difference]: Finished difference. Result has 225 places, 223 transitions, 478 flow [2024-11-09 06:58:20,348 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=225, PETRI_TRANSITIONS=223} [2024-11-09 06:58:20,353 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -3 predicate places. [2024-11-09 06:58:20,354 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 223 transitions, 478 flow [2024-11-09 06:58:20,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:20,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:20,355 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:20,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:58:20,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 06:58:20,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash 211532478, now seen corresponding path program 1 times [2024-11-09 06:58:20,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:20,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494231062] [2024-11-09 06:58:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:20,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:20,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:20,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494231062] [2024-11-09 06:58:20,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494231062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:20,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:20,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:20,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767257945] [2024-11-09 06:58:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:20,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:20,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:20,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:20,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:20,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 237 [2024-11-09 06:58:20,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 223 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:20,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:20,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 237 [2024-11-09 06:58:20,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:20,756 INFO L124 PetriNetUnfolderBase]: 115/1372 cut-off events. [2024-11-09 06:58:20,757 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 06:58:20,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 1372 events. 115/1372 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8298 event pairs, 72 based on Foata normal form. 0/1225 useless extension candidates. Maximal degree in co-relation 1664. Up to 207 conditions per place. [2024-11-09 06:58:20,768 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 28 selfloop transitions, 4 changer transitions 0/232 dead transitions. [2024-11-09 06:58:20,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 232 transitions, 560 flow [2024-11-09 06:58:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2024-11-09 06:58:20,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8945147679324894 [2024-11-09 06:58:20,771 INFO L175 Difference]: Start difference. First operand has 225 places, 223 transitions, 478 flow. Second operand 3 states and 636 transitions. [2024-11-09 06:58:20,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 232 transitions, 560 flow [2024-11-09 06:58:20,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 232 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:20,780 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 498 flow [2024-11-09 06:58:20,780 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2024-11-09 06:58:20,781 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -1 predicate places. [2024-11-09 06:58:20,781 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 498 flow [2024-11-09 06:58:20,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:20,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:20,784 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:20,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:58:20,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 06:58:20,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:20,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1938240668, now seen corresponding path program 1 times [2024-11-09 06:58:20,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:20,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199251356] [2024-11-09 06:58:20,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:20,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:20,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199251356] [2024-11-09 06:58:20,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199251356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:20,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:20,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:20,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114574731] [2024-11-09 06:58:20,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:20,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:20,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:20,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:20,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:20,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 237 [2024-11-09 06:58:20,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:20,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:20,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 237 [2024-11-09 06:58:20,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:21,221 INFO L124 PetriNetUnfolderBase]: 122/2008 cut-off events. [2024-11-09 06:58:21,221 INFO L125 PetriNetUnfolderBase]: For 46/49 co-relation queries the response was YES. [2024-11-09 06:58:21,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 2008 events. 122/2008 cut-off events. For 46/49 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14340 event pairs, 26 based on Foata normal form. 0/1813 useless extension candidates. Maximal degree in co-relation 2381. Up to 146 conditions per place. [2024-11-09 06:58:21,233 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 30 selfloop transitions, 4 changer transitions 0/240 dead transitions. [2024-11-09 06:58:21,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 240 transitions, 598 flow [2024-11-09 06:58:21,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2024-11-09 06:58:21,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9127988748241913 [2024-11-09 06:58:21,236 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 498 flow. Second operand 3 states and 649 transitions. [2024-11-09 06:58:21,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 240 transitions, 598 flow [2024-11-09 06:58:21,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 240 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:21,241 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 518 flow [2024-11-09 06:58:21,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2024-11-09 06:58:21,243 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2024-11-09 06:58:21,243 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 518 flow [2024-11-09 06:58:21,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:21,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:21,244 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:21,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:58:21,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 06:58:21,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:21,245 INFO L85 PathProgramCache]: Analyzing trace with hash -586780389, now seen corresponding path program 1 times [2024-11-09 06:58:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:21,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556328880] [2024-11-09 06:58:21,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:21,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:21,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556328880] [2024-11-09 06:58:21,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556328880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:21,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:21,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:21,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930939650] [2024-11-09 06:58:21,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:21,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:21,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:21,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:21,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:21,310 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 237 [2024-11-09 06:58:21,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:21,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:21,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 237 [2024-11-09 06:58:21,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:21,691 INFO L124 PetriNetUnfolderBase]: 240/3005 cut-off events. [2024-11-09 06:58:21,691 INFO L125 PetriNetUnfolderBase]: For 25/28 co-relation queries the response was YES. [2024-11-09 06:58:21,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 3005 events. 240/3005 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 25014 event pairs, 34 based on Foata normal form. 0/2707 useless extension candidates. Maximal degree in co-relation 3641. Up to 299 conditions per place. [2024-11-09 06:58:21,708 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 31 selfloop transitions, 4 changer transitions 0/243 dead transitions. [2024-11-09 06:58:21,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 243 transitions, 618 flow [2024-11-09 06:58:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2024-11-09 06:58:21,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9113924050632911 [2024-11-09 06:58:21,711 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 518 flow. Second operand 3 states and 648 transitions. [2024-11-09 06:58:21,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 243 transitions, 618 flow [2024-11-09 06:58:21,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 243 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:21,718 INFO L231 Difference]: Finished difference. Result has 231 places, 231 transitions, 540 flow [2024-11-09 06:58:21,719 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=231, PETRI_TRANSITIONS=231} [2024-11-09 06:58:21,720 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, 3 predicate places. [2024-11-09 06:58:21,720 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 231 transitions, 540 flow [2024-11-09 06:58:21,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:21,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:21,721 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:21,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:58:21,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 06:58:21,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash -359842066, now seen corresponding path program 1 times [2024-11-09 06:58:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574271389] [2024-11-09 06:58:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:22,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:22,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574271389] [2024-11-09 06:58:22,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574271389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:22,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:22,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:58:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446821910] [2024-11-09 06:58:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:22,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:22,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:22,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:22,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:22,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 237 [2024-11-09 06:58:22,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 231 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:22,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:22,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 237 [2024-11-09 06:58:22,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:22,259 INFO L124 PetriNetUnfolderBase]: 40/1040 cut-off events. [2024-11-09 06:58:22,259 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-09 06:58:22,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 1040 events. 40/1040 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4984 event pairs, 23 based on Foata normal form. 8/973 useless extension candidates. Maximal degree in co-relation 1218. Up to 82 conditions per place. [2024-11-09 06:58:22,264 INFO L140 encePairwiseOnDemand]: 227/237 looper letters, 17 selfloop transitions, 10 changer transitions 1/229 dead transitions. [2024-11-09 06:58:22,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 229 transitions, 562 flow [2024-11-09 06:58:22,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:58:22,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 06:58:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1066 transitions. [2024-11-09 06:58:22,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8995780590717299 [2024-11-09 06:58:22,268 INFO L175 Difference]: Start difference. First operand has 231 places, 231 transitions, 540 flow. Second operand 5 states and 1066 transitions. [2024-11-09 06:58:22,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 229 transitions, 562 flow [2024-11-09 06:58:22,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 229 transitions, 532 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-09 06:58:22,273 INFO L231 Difference]: Finished difference. Result has 226 places, 222 transitions, 498 flow [2024-11-09 06:58:22,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=498, PETRI_PLACES=226, PETRI_TRANSITIONS=222} [2024-11-09 06:58:22,275 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -2 predicate places. [2024-11-09 06:58:22,276 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 222 transitions, 498 flow [2024-11-09 06:58:22,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:22,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:22,277 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:22,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:58:22,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 06:58:22,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:22,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1761699075, now seen corresponding path program 1 times [2024-11-09 06:58:22,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:22,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887644602] [2024-11-09 06:58:22,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:22,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:22,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:22,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887644602] [2024-11-09 06:58:22,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887644602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:22,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:22,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:22,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996622129] [2024-11-09 06:58:22,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:22,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:22,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:22,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:22,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 237 [2024-11-09 06:58:22,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 222 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:22,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:22,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 237 [2024-11-09 06:58:22,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:22,617 INFO L124 PetriNetUnfolderBase]: 66/1216 cut-off events. [2024-11-09 06:58:22,618 INFO L125 PetriNetUnfolderBase]: For 104/106 co-relation queries the response was YES. [2024-11-09 06:58:22,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 1216 events. 66/1216 cut-off events. For 104/106 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6789 event pairs, 59 based on Foata normal form. 0/1122 useless extension candidates. Maximal degree in co-relation 1518. Up to 189 conditions per place. [2024-11-09 06:58:22,623 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 28 selfloop transitions, 3 changer transitions 0/223 dead transitions. [2024-11-09 06:58:22,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 223 transitions, 565 flow [2024-11-09 06:58:22,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2024-11-09 06:58:22,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8804500703234881 [2024-11-09 06:58:22,626 INFO L175 Difference]: Start difference. First operand has 226 places, 222 transitions, 498 flow. Second operand 3 states and 626 transitions. [2024-11-09 06:58:22,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 223 transitions, 565 flow [2024-11-09 06:58:22,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 223 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:22,632 INFO L231 Difference]: Finished difference. Result has 225 places, 221 transitions, 499 flow [2024-11-09 06:58:22,632 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=225, PETRI_TRANSITIONS=221} [2024-11-09 06:58:22,634 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -3 predicate places. [2024-11-09 06:58:22,634 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 221 transitions, 499 flow [2024-11-09 06:58:22,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:22,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:22,635 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:22,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:58:22,636 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 06:58:22,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:22,637 INFO L85 PathProgramCache]: Analyzing trace with hash 85735142, now seen corresponding path program 1 times [2024-11-09 06:58:22,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:22,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53501119] [2024-11-09 06:58:22,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:22,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:22,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53501119] [2024-11-09 06:58:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53501119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:22,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:22,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7655608] [2024-11-09 06:58:22,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:22,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:22,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:22,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:22,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 237 [2024-11-09 06:58:22,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 221 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:22,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:22,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 237 [2024-11-09 06:58:22,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:22,874 INFO L124 PetriNetUnfolderBase]: 69/1218 cut-off events. [2024-11-09 06:58:22,874 INFO L125 PetriNetUnfolderBase]: For 114/118 co-relation queries the response was YES. [2024-11-09 06:58:22,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1600 conditions, 1218 events. 69/1218 cut-off events. For 114/118 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6792 event pairs, 60 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 1547. Up to 193 conditions per place. [2024-11-09 06:58:22,879 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 28 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2024-11-09 06:58:22,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 566 flow [2024-11-09 06:58:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2024-11-09 06:58:22,881 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8804500703234881 [2024-11-09 06:58:22,882 INFO L175 Difference]: Start difference. First operand has 225 places, 221 transitions, 499 flow. Second operand 3 states and 626 transitions. [2024-11-09 06:58:22,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 566 flow [2024-11-09 06:58:22,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 222 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:22,886 INFO L231 Difference]: Finished difference. Result has 224 places, 220 transitions, 497 flow [2024-11-09 06:58:22,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=224, PETRI_TRANSITIONS=220} [2024-11-09 06:58:22,887 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -4 predicate places. [2024-11-09 06:58:22,887 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 220 transitions, 497 flow [2024-11-09 06:58:22,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:22,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:22,888 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:22,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:58:22,888 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 06:58:22,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:22,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1634830210, now seen corresponding path program 1 times [2024-11-09 06:58:22,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:22,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056240079] [2024-11-09 06:58:22,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:22,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:22,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:22,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056240079] [2024-11-09 06:58:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056240079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:22,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:22,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:22,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334766716] [2024-11-09 06:58:22,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:22,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:22,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:22,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:22,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 237 [2024-11-09 06:58:22,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 220 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:22,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:22,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 237 [2024-11-09 06:58:22,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:23,136 INFO L124 PetriNetUnfolderBase]: 112/1285 cut-off events. [2024-11-09 06:58:23,136 INFO L125 PetriNetUnfolderBase]: For 116/123 co-relation queries the response was YES. [2024-11-09 06:58:23,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 1285 events. 112/1285 cut-off events. For 116/123 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7250 event pairs, 82 based on Foata normal form. 0/1182 useless extension candidates. Maximal degree in co-relation 1717. Up to 254 conditions per place. [2024-11-09 06:58:23,141 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 29 selfloop transitions, 5 changer transitions 9/230 dead transitions. [2024-11-09 06:58:23,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 230 transitions, 603 flow [2024-11-09 06:58:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2024-11-09 06:58:23,144 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.890295358649789 [2024-11-09 06:58:23,144 INFO L175 Difference]: Start difference. First operand has 224 places, 220 transitions, 497 flow. Second operand 3 states and 633 transitions. [2024-11-09 06:58:23,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 230 transitions, 603 flow [2024-11-09 06:58:23,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 230 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:23,148 INFO L231 Difference]: Finished difference. Result has 226 places, 217 transitions, 502 flow [2024-11-09 06:58:23,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=226, PETRI_TRANSITIONS=217} [2024-11-09 06:58:23,149 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -2 predicate places. [2024-11-09 06:58:23,149 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 217 transitions, 502 flow [2024-11-09 06:58:23,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:23,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:23,150 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:23,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:58:23,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 06:58:23,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash -238349530, now seen corresponding path program 1 times [2024-11-09 06:58:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:23,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146738973] [2024-11-09 06:58:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:23,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:23,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146738973] [2024-11-09 06:58:23,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146738973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:23,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:23,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:23,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301854068] [2024-11-09 06:58:23,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:23,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:23,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:23,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:23,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:23,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 237 [2024-11-09 06:58:23,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 217 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:23,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:23,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 237 [2024-11-09 06:58:23,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:23,358 INFO L124 PetriNetUnfolderBase]: 73/1011 cut-off events. [2024-11-09 06:58:23,359 INFO L125 PetriNetUnfolderBase]: For 111/114 co-relation queries the response was YES. [2024-11-09 06:58:23,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 1011 events. 73/1011 cut-off events. For 111/114 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4910 event pairs, 52 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1366. Up to 172 conditions per place. [2024-11-09 06:58:23,363 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 28 selfloop transitions, 5 changer transitions 0/224 dead transitions. [2024-11-09 06:58:23,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 224 transitions, 589 flow [2024-11-09 06:58:23,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 634 transitions. [2024-11-09 06:58:23,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8917018284106891 [2024-11-09 06:58:23,365 INFO L175 Difference]: Start difference. First operand has 226 places, 217 transitions, 502 flow. Second operand 3 states and 634 transitions. [2024-11-09 06:58:23,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 224 transitions, 589 flow [2024-11-09 06:58:23,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 224 transitions, 575 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:23,370 INFO L231 Difference]: Finished difference. Result has 228 places, 220 transitions, 526 flow [2024-11-09 06:58:23,371 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=228, PETRI_TRANSITIONS=220} [2024-11-09 06:58:23,371 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, 0 predicate places. [2024-11-09 06:58:23,372 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 220 transitions, 526 flow [2024-11-09 06:58:23,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:23,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:23,373 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:23,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:58:23,373 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 06:58:23,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash 594234345, now seen corresponding path program 1 times [2024-11-09 06:58:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:23,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839538764] [2024-11-09 06:58:23,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:23,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:23,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839538764] [2024-11-09 06:58:23,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839538764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:23,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:23,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:23,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248325549] [2024-11-09 06:58:23,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:23,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:23,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:23,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:23,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:23,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 237 [2024-11-09 06:58:23,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 220 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:23,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:23,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 237 [2024-11-09 06:58:23,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:23,564 INFO L124 PetriNetUnfolderBase]: 63/1035 cut-off events. [2024-11-09 06:58:23,564 INFO L125 PetriNetUnfolderBase]: For 198/203 co-relation queries the response was YES. [2024-11-09 06:58:23,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 1035 events. 63/1035 cut-off events. For 198/203 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5091 event pairs, 30 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 1418. Up to 110 conditions per place. [2024-11-09 06:58:23,568 INFO L140 encePairwiseOnDemand]: 232/237 looper letters, 24 selfloop transitions, 3 changer transitions 12/232 dead transitions. [2024-11-09 06:58:23,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 232 transitions, 644 flow [2024-11-09 06:58:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2024-11-09 06:58:23,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9029535864978903 [2024-11-09 06:58:23,571 INFO L175 Difference]: Start difference. First operand has 228 places, 220 transitions, 526 flow. Second operand 3 states and 642 transitions. [2024-11-09 06:58:23,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 232 transitions, 644 flow [2024-11-09 06:58:23,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 232 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:23,575 INFO L231 Difference]: Finished difference. Result has 230 places, 218 transitions, 530 flow [2024-11-09 06:58:23,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=230, PETRI_TRANSITIONS=218} [2024-11-09 06:58:23,576 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, 2 predicate places. [2024-11-09 06:58:23,577 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 218 transitions, 530 flow [2024-11-09 06:58:23,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:23,577 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:23,578 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:23,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:58:23,578 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-09 06:58:23,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash -248028292, now seen corresponding path program 1 times [2024-11-09 06:58:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:23,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159822168] [2024-11-09 06:58:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:24,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:24,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159822168] [2024-11-09 06:58:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159822168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:24,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:24,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:58:24,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253132898] [2024-11-09 06:58:24,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:24,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:58:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:58:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:58:24,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 237 [2024-11-09 06:58:24,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 218 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 208.14285714285714) internal successors, (1457), 7 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:24,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:24,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 237 [2024-11-09 06:58:24,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:24,309 INFO L124 PetriNetUnfolderBase]: 16/563 cut-off events. [2024-11-09 06:58:24,309 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-09 06:58:24,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 563 events. 16/563 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1656 event pairs, 2 based on Foata normal form. 6/540 useless extension candidates. Maximal degree in co-relation 681. Up to 45 conditions per place. [2024-11-09 06:58:24,310 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 0 selfloop transitions, 0 changer transitions 209/209 dead transitions. [2024-11-09 06:58:24,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 209 transitions, 543 flow [2024-11-09 06:58:24,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:58:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1261 transitions. [2024-11-09 06:58:24,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8867791842475387 [2024-11-09 06:58:24,313 INFO L175 Difference]: Start difference. First operand has 230 places, 218 transitions, 530 flow. Second operand 6 states and 1261 transitions. [2024-11-09 06:58:24,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 209 transitions, 543 flow [2024-11-09 06:58:24,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 209 transitions, 502 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-11-09 06:58:24,316 INFO L231 Difference]: Finished difference. Result has 217 places, 0 transitions, 0 flow [2024-11-09 06:58:24,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=217, PETRI_TRANSITIONS=0} [2024-11-09 06:58:24,317 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -11 predicate places. [2024-11-09 06:58:24,317 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 0 transitions, 0 flow [2024-11-09 06:58:24,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 208.14285714285714) internal successors, (1457), 7 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:24,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2024-11-09 06:58:24,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-09 06:58:24,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-09 06:58:24,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-09 06:58:24,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-09 06:58:24,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2024-11-09 06:58:24,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-09 06:58:24,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-09 06:58:24,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-09 06:58:24,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-09 06:58:24,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-09 06:58:24,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-09 06:58:24,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-09 06:58:24,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-09 06:58:24,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:58:24,323 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:24,329 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:58:24,329 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:58:24,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:58:24 BasicIcfg [2024-11-09 06:58:24,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:58:24,336 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:58:24,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:58:24,336 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:58:24,340 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:19" (3/4) ... [2024-11-09 06:58:24,342 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 06:58:24,345 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2024-11-09 06:58:24,350 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-09 06:58:24,350 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 06:58:24,350 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 06:58:24,350 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 06:58:24,433 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:58:24,433 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 06:58:24,434 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:58:24,434 INFO L158 Benchmark]: Toolchain (without parser) took 6618.47ms. Allocated memory was 146.8MB in the beginning and 224.4MB in the end (delta: 77.6MB). Free memory was 119.3MB in the beginning and 171.6MB in the end (delta: -52.3MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-11-09 06:58:24,434 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:58:24,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.36ms. Allocated memory is still 146.8MB. Free memory was 118.8MB in the beginning and 95.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 06:58:24,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.20ms. Allocated memory is still 146.8MB. Free memory was 95.7MB in the beginning and 93.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:58:24,435 INFO L158 Benchmark]: Boogie Preprocessor took 28.93ms. Allocated memory is still 146.8MB. Free memory was 93.1MB in the beginning and 91.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:58:24,435 INFO L158 Benchmark]: RCFGBuilder took 638.41ms. Allocated memory is still 146.8MB. Free memory was 91.0MB in the beginning and 66.9MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 06:58:24,436 INFO L158 Benchmark]: TraceAbstraction took 5203.63ms. Allocated memory was 146.8MB in the beginning and 224.4MB in the end (delta: 77.6MB). Free memory was 65.8MB in the beginning and 175.8MB in the end (delta: -110.0MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2024-11-09 06:58:24,436 INFO L158 Benchmark]: Witness Printer took 98.11ms. Allocated memory is still 224.4MB. Free memory was 175.8MB in the beginning and 171.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:58:24,437 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.36ms. Allocated memory is still 146.8MB. Free memory was 118.8MB in the beginning and 95.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.20ms. Allocated memory is still 146.8MB. Free memory was 95.7MB in the beginning and 93.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.93ms. Allocated memory is still 146.8MB. Free memory was 93.1MB in the beginning and 91.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 638.41ms. Allocated memory is still 146.8MB. Free memory was 91.0MB in the beginning and 66.9MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5203.63ms. Allocated memory was 146.8MB in the beginning and 224.4MB in the end (delta: 77.6MB). Free memory was 65.8MB in the beginning and 175.8MB in the end (delta: -110.0MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. * Witness Printer took 98.11ms. Allocated memory is still 224.4MB. Free memory was 175.8MB in the beginning and 171.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 737]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 738]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 739]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 742]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 746]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 716]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 717]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 722]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 723]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 332 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 810 IncrementalHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 34 mSDtfsCounter, 810 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 985 NumberOfCodeBlocks, 985 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 974 ConstructedInterpolants, 0 QuantifiedInterpolants, 2337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 06:58:24,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE