./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:13:09,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:13:09,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:13:09,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:13:09,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:13:09,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:13:09,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:13:09,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:13:09,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:13:09,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:13:09,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:13:09,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:13:09,864 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:13:09,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:13:09,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:13:09,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:13:09,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:13:09,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:13:09,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:13:09,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:13:09,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:13:09,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:13:09,867 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:13:09,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:13:09,867 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:13:09,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:13:09,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:13:09,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:13:09,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:13:09,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:13:09,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:13:09,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:09,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:13:09,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:13:09,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:13:09,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:13:09,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:13:09,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:13:09,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:13:09,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:13:09,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:13:09,870 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 [2024-10-11 17:13:10,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:13:10,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:13:10,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:13:10,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:13:10,112 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:13:10,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2024-10-11 17:13:11,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:13:11,577 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:13:11,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2024-10-11 17:13:11,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d749ff52/1661ad0a39f64120a17697a9d15cb1ce/FLAG181cf452d [2024-10-11 17:13:11,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d749ff52/1661ad0a39f64120a17697a9d15cb1ce [2024-10-11 17:13:11,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:13:11,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:13:11,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:11,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:13:11,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:13:11,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:11" (1/1) ... [2024-10-11 17:13:11,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c19737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:11, skipping insertion in model container [2024-10-11 17:13:11,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:11" (1/1) ... [2024-10-11 17:13:12,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:13:12,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:12,255 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:13:12,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:12,301 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:13:12,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12 WrapperNode [2024-10-11 17:13:12,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:12,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:12,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:13:12,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:13:12,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (1/1) ... [2024-10-11 17:13:12,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (1/1) ... [2024-10-11 17:13:12,333 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-10-11 17:13:12,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:12,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:13:12,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:13:12,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:13:12,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (1/1) ... [2024-10-11 17:13:12,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (1/1) ... [2024-10-11 17:13:12,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (1/1) ... [2024-10-11 17:13:12,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (1/1) ... [2024-10-11 17:13:12,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (1/1) ... [2024-10-11 17:13:12,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (1/1) ... [2024-10-11 17:13:12,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (1/1) ... [2024-10-11 17:13:12,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (1/1) ... [2024-10-11 17:13:12,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:13:12,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:13:12,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:13:12,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:13:12,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (1/1) ... [2024-10-11 17:13:12,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:12,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:12,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:13:12,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:13:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:13:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:13:12,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:13:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:13:12,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:13:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:13:12,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:13:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-11 17:13:12,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-11 17:13:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:13:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:13:12,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:13:12,453 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:13:12,568 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:13:12,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:13:12,933 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:13:12,933 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:13:12,956 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:13:12,956 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 17:13:12,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:12 BoogieIcfgContainer [2024-10-11 17:13:12,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:13:12,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:13:12,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:13:12,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:13:12,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:13:11" (1/3) ... [2024-10-11 17:13:12,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fab2b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:12, skipping insertion in model container [2024-10-11 17:13:12,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:12" (2/3) ... [2024-10-11 17:13:12,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fab2b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:12, skipping insertion in model container [2024-10-11 17:13:12,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:12" (3/3) ... [2024-10-11 17:13:12,965 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-10-11 17:13:12,985 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:13:12,985 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-10-11 17:13:12,985 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:13:13,069 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-11 17:13:13,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 259 transitions, 546 flow [2024-10-11 17:13:13,164 INFO L124 PetriNetUnfolderBase]: 14/255 cut-off events. [2024-10-11 17:13:13,164 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:13:13,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 255 events. 14/255 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 416 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place. [2024-10-11 17:13:13,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 259 transitions, 546 flow [2024-10-11 17:13:13,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 236 places, 235 transitions, 494 flow [2024-10-11 17:13:13,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:13:13,189 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;@571e4788, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:13:13,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-10-11 17:13:13,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:13:13,197 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-10-11 17:13:13,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:13:13,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:13,201 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] [2024-10-11 17:13:13,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:13,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:13,206 INFO L85 PathProgramCache]: Analyzing trace with hash 380133642, now seen corresponding path program 1 times [2024-10-11 17:13:13,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:13,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843313169] [2024-10-11 17:13:13,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:13,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:13,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843313169] [2024-10-11 17:13:13,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843313169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:13,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:13,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:13,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818092947] [2024-10-11 17:13:13,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:13,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:13,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:13,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:13,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:13,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 259 [2024-10-11 17:13:13,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 235 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:13,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:13,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 259 [2024-10-11 17:13:13,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:13,581 INFO L124 PetriNetUnfolderBase]: 22/310 cut-off events. [2024-10-11 17:13:13,581 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-10-11 17:13:13,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 310 events. 22/310 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 986 event pairs, 12 based on Foata normal form. 37/285 useless extension candidates. Maximal degree in co-relation 294. Up to 46 conditions per place. [2024-10-11 17:13:13,589 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 18 selfloop transitions, 2 changer transitions 1/229 dead transitions. [2024-10-11 17:13:13,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 229 transitions, 522 flow [2024-10-11 17:13:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:13,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2024-10-11 17:13:13,608 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9214929214929215 [2024-10-11 17:13:13,611 INFO L175 Difference]: Start difference. First operand has 236 places, 235 transitions, 494 flow. Second operand 3 states and 716 transitions. [2024-10-11 17:13:13,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 229 transitions, 522 flow [2024-10-11 17:13:13,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 229 transitions, 506 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 17:13:13,621 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 468 flow [2024-10-11 17:13:13,624 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2024-10-11 17:13:13,629 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -7 predicate places. [2024-10-11 17:13:13,629 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 468 flow [2024-10-11 17:13:13,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:13,630 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:13,631 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:13,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:13:13,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:13,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:13,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1582249989, now seen corresponding path program 1 times [2024-10-11 17:13:13,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:13,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269762075] [2024-10-11 17:13:13,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:13,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:13,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:13,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269762075] [2024-10-11 17:13:13,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269762075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:13,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:13,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541767810] [2024-10-11 17:13:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:13,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:13,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:13,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:13,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:13,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259 [2024-10-11 17:13:13,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:13,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:13,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259 [2024-10-11 17:13:13,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:13,835 INFO L124 PetriNetUnfolderBase]: 22/308 cut-off events. [2024-10-11 17:13:13,835 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:13,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 308 events. 22/308 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 918 event pairs, 12 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 341. Up to 45 conditions per place. [2024-10-11 17:13:13,839 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 17 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2024-10-11 17:13:13,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 227 transitions, 504 flow [2024-10-11 17:13:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-10-11 17:13:13,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176 [2024-10-11 17:13:13,846 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 468 flow. Second operand 3 states and 713 transitions. [2024-10-11 17:13:13,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 227 transitions, 504 flow [2024-10-11 17:13:13,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 227 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:13,853 INFO L231 Difference]: Finished difference. Result has 227 places, 227 transitions, 466 flow [2024-10-11 17:13:13,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=227, PETRI_TRANSITIONS=227} [2024-10-11 17:13:13,855 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -9 predicate places. [2024-10-11 17:13:13,855 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 227 transitions, 466 flow [2024-10-11 17:13:13,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:13,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:13,855 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:13,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:13:13,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:13,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1361925789, now seen corresponding path program 1 times [2024-10-11 17:13:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:13,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489437324] [2024-10-11 17:13:13,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:13,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489437324] [2024-10-11 17:13:13,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489437324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:13,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:13,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635244480] [2024-10-11 17:13:13,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:13,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:13,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:13,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:13,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:13,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 259 [2024-10-11 17:13:13,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 227 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:13,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:13,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 259 [2024-10-11 17:13:13,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:13,976 INFO L124 PetriNetUnfolderBase]: 22/289 cut-off events. [2024-10-11 17:13:13,976 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:13:13,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 289 events. 22/289 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 773 event pairs, 12 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 312. Up to 46 conditions per place. [2024-10-11 17:13:13,980 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 18 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2024-10-11 17:13:13,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 226 transitions, 504 flow [2024-10-11 17:13:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2024-10-11 17:13:13,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.915057915057915 [2024-10-11 17:13:13,983 INFO L175 Difference]: Start difference. First operand has 227 places, 227 transitions, 466 flow. Second operand 3 states and 711 transitions. [2024-10-11 17:13:13,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 226 transitions, 504 flow [2024-10-11 17:13:13,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 226 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:13,989 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 464 flow [2024-10-11 17:13:13,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2024-10-11 17:13:13,990 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -10 predicate places. [2024-10-11 17:13:13,990 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 464 flow [2024-10-11 17:13:13,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:13,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:13,991 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] [2024-10-11 17:13:13,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:13:13,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:13,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:13,992 INFO L85 PathProgramCache]: Analyzing trace with hash 867166823, now seen corresponding path program 1 times [2024-10-11 17:13:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:13,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624885506] [2024-10-11 17:13:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:13,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:14,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:14,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624885506] [2024-10-11 17:13:14,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624885506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:14,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:14,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:14,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341996362] [2024-10-11 17:13:14,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:14,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:14,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:14,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:14,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:14,058 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259 [2024-10-11 17:13:14,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:14,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259 [2024-10-11 17:13:14,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:14,095 INFO L124 PetriNetUnfolderBase]: 22/270 cut-off events. [2024-10-11 17:13:14,096 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:13:14,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 270 events. 22/270 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 619 event pairs, 12 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 281. Up to 45 conditions per place. [2024-10-11 17:13:14,098 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 17 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2024-10-11 17:13:14,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 225 transitions, 500 flow [2024-10-11 17:13:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-10-11 17:13:14,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176 [2024-10-11 17:13:14,100 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 464 flow. Second operand 3 states and 713 transitions. [2024-10-11 17:13:14,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 225 transitions, 500 flow [2024-10-11 17:13:14,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 225 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:14,103 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 462 flow [2024-10-11 17:13:14,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2024-10-11 17:13:14,104 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -11 predicate places. [2024-10-11 17:13:14,104 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 462 flow [2024-10-11 17:13:14,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:14,105 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] [2024-10-11 17:13:14,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:13:14,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:14,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2011416729, now seen corresponding path program 1 times [2024-10-11 17:13:14,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:14,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553766228] [2024-10-11 17:13:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:14,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:14,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:14,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553766228] [2024-10-11 17:13:14,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553766228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:14,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:14,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:14,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986880198] [2024-10-11 17:13:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:14,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:14,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:14,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:14,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:14,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259 [2024-10-11 17:13:14,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:14,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259 [2024-10-11 17:13:14,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:14,272 INFO L124 PetriNetUnfolderBase]: 102/982 cut-off events. [2024-10-11 17:13:14,273 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:13:14,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 982 events. 102/982 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6241 event pairs, 51 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 1096. Up to 144 conditions per place. [2024-10-11 17:13:14,283 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 15 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2024-10-11 17:13:14,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 224 transitions, 494 flow [2024-10-11 17:13:14,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-10-11 17:13:14,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228 [2024-10-11 17:13:14,286 INFO L175 Difference]: Start difference. First operand has 225 places, 225 transitions, 462 flow. Second operand 3 states and 717 transitions. [2024-10-11 17:13:14,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 224 transitions, 494 flow [2024-10-11 17:13:14,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 224 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:14,289 INFO L231 Difference]: Finished difference. Result has 224 places, 224 transitions, 460 flow [2024-10-11 17:13:14,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=224, PETRI_TRANSITIONS=224} [2024-10-11 17:13:14,291 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -12 predicate places. [2024-10-11 17:13:14,291 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 224 transitions, 460 flow [2024-10-11 17:13:14,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:14,293 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:14,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:13:14,293 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:14,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash -636728045, now seen corresponding path program 1 times [2024-10-11 17:13:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:14,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85569472] [2024-10-11 17:13:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:14,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:14,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85569472] [2024-10-11 17:13:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85569472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:14,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:14,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431453226] [2024-10-11 17:13:14,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:14,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:14,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:14,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:14,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 259 [2024-10-11 17:13:14,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 224 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:14,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 259 [2024-10-11 17:13:14,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:14,388 INFO L124 PetriNetUnfolderBase]: 31/300 cut-off events. [2024-10-11 17:13:14,388 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:13:14,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 300 events. 31/300 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1000 event pairs, 18 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 340. Up to 60 conditions per place. [2024-10-11 17:13:14,391 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 23 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2024-10-11 17:13:14,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 222 transitions, 511 flow [2024-10-11 17:13:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2024-10-11 17:13:14,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9060489060489061 [2024-10-11 17:13:14,392 INFO L175 Difference]: Start difference. First operand has 224 places, 224 transitions, 460 flow. Second operand 3 states and 704 transitions. [2024-10-11 17:13:14,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 222 transitions, 511 flow [2024-10-11 17:13:14,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 222 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:14,396 INFO L231 Difference]: Finished difference. Result has 219 places, 219 transitions, 457 flow [2024-10-11 17:13:14,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=219, PETRI_TRANSITIONS=219} [2024-10-11 17:13:14,398 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -17 predicate places. [2024-10-11 17:13:14,398 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 219 transitions, 457 flow [2024-10-11 17:13:14,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:14,399 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] [2024-10-11 17:13:14,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:13:14,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:14,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:14,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2010283632, now seen corresponding path program 1 times [2024-10-11 17:13:14,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:14,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257525333] [2024-10-11 17:13:14,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:14,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:14,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:14,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257525333] [2024-10-11 17:13:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257525333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:14,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:14,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:14,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854510828] [2024-10-11 17:13:14,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:14,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:14,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:14,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:14,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:14,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 259 [2024-10-11 17:13:14,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 219 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:14,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 259 [2024-10-11 17:13:14,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:14,515 INFO L124 PetriNetUnfolderBase]: 31/296 cut-off events. [2024-10-11 17:13:14,515 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:13:14,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 296 events. 31/296 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 955 event pairs, 18 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 322. Up to 58 conditions per place. [2024-10-11 17:13:14,519 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 21 selfloop transitions, 3 changer transitions 0/218 dead transitions. [2024-10-11 17:13:14,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 506 flow [2024-10-11 17:13:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2024-10-11 17:13:14,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9137709137709138 [2024-10-11 17:13:14,521 INFO L175 Difference]: Start difference. First operand has 219 places, 219 transitions, 457 flow. Second operand 3 states and 710 transitions. [2024-10-11 17:13:14,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 506 flow [2024-10-11 17:13:14,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 218 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:14,525 INFO L231 Difference]: Finished difference. Result has 216 places, 215 transitions, 457 flow [2024-10-11 17:13:14,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=216, PETRI_TRANSITIONS=215} [2024-10-11 17:13:14,525 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -20 predicate places. [2024-10-11 17:13:14,526 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 215 transitions, 457 flow [2024-10-11 17:13:14,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:14,527 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-10-11 17:13:14,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:13:14,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:14,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:14,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1525805944, now seen corresponding path program 1 times [2024-10-11 17:13:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:14,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084626590] [2024-10-11 17:13:14,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:14,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:14,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084626590] [2024-10-11 17:13:14,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084626590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:14,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:14,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:14,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53843577] [2024-10-11 17:13:14,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:14,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:14,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:14,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:14,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:14,593 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 259 [2024-10-11 17:13:14,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 215 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:14,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 259 [2024-10-11 17:13:14,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:14,655 INFO L124 PetriNetUnfolderBase]: 39/409 cut-off events. [2024-10-11 17:13:14,655 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 17:13:14,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 409 events. 39/409 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1619 event pairs, 15 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 444. Up to 64 conditions per place. [2024-10-11 17:13:14,658 INFO L140 encePairwiseOnDemand]: 249/259 looper letters, 26 selfloop transitions, 4 changer transitions 0/217 dead transitions. [2024-10-11 17:13:14,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 217 transitions, 527 flow [2024-10-11 17:13:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2024-10-11 17:13:14,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9111969111969112 [2024-10-11 17:13:14,660 INFO L175 Difference]: Start difference. First operand has 216 places, 215 transitions, 457 flow. Second operand 3 states and 708 transitions. [2024-10-11 17:13:14,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 217 transitions, 527 flow [2024-10-11 17:13:14,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 217 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:14,664 INFO L231 Difference]: Finished difference. Result has 212 places, 211 transitions, 462 flow [2024-10-11 17:13:14,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=212, PETRI_TRANSITIONS=211} [2024-10-11 17:13:14,665 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -24 predicate places. [2024-10-11 17:13:14,665 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 211 transitions, 462 flow [2024-10-11 17:13:14,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:14,665 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] [2024-10-11 17:13:14,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:13:14,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:14,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:14,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1715679788, now seen corresponding path program 1 times [2024-10-11 17:13:14,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:14,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420146167] [2024-10-11 17:13:14,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:14,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:14,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420146167] [2024-10-11 17:13:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420146167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:14,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:14,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:13:14,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788670529] [2024-10-11 17:13:14,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:14,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:13:14,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:14,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:13:14,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:13:14,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259 [2024-10-11 17:13:14,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 211 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 233.25) internal successors, (933), 4 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:14,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259 [2024-10-11 17:13:14,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:14,814 INFO L124 PetriNetUnfolderBase]: 12/347 cut-off events. [2024-10-11 17:13:14,815 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:13:14,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 347 events. 12/347 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1119 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 291. Up to 26 conditions per place. [2024-10-11 17:13:14,818 INFO L140 encePairwiseOnDemand]: 253/259 looper letters, 19 selfloop transitions, 5 changer transitions 0/216 dead transitions. [2024-10-11 17:13:14,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 216 transitions, 520 flow [2024-10-11 17:13:14,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:13:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:13:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1185 transitions. [2024-10-11 17:13:14,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.915057915057915 [2024-10-11 17:13:14,820 INFO L175 Difference]: Start difference. First operand has 212 places, 211 transitions, 462 flow. Second operand 5 states and 1185 transitions. [2024-10-11 17:13:14,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 216 transitions, 520 flow [2024-10-11 17:13:14,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 216 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:14,826 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 496 flow [2024-10-11 17:13:14,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=496, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2024-10-11 17:13:14,827 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -17 predicate places. [2024-10-11 17:13:14,827 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 496 flow [2024-10-11 17:13:14,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 233.25) internal successors, (933), 4 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:14,828 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] [2024-10-11 17:13:14,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:13:14,829 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:14,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1660716693, now seen corresponding path program 1 times [2024-10-11 17:13:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:14,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510469164] [2024-10-11 17:13:14,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:14,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:14,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510469164] [2024-10-11 17:13:14,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510469164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:14,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:14,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:14,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283531949] [2024-10-11 17:13:14,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:14,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:14,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:14,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:14,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:14,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 259 [2024-10-11 17:13:14,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:14,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 259 [2024-10-11 17:13:14,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:14,970 INFO L124 PetriNetUnfolderBase]: 58/561 cut-off events. [2024-10-11 17:13:14,970 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-10-11 17:13:14,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 561 events. 58/561 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2829 event pairs, 5 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 497. Up to 92 conditions per place. [2024-10-11 17:13:14,975 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 22 selfloop transitions, 3 changer transitions 10/218 dead transitions. [2024-10-11 17:13:14,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 563 flow [2024-10-11 17:13:14,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-10-11 17:13:14,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176 [2024-10-11 17:13:14,977 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 496 flow. Second operand 3 states and 713 transitions. [2024-10-11 17:13:14,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 563 flow [2024-10-11 17:13:14,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 218 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:14,980 INFO L231 Difference]: Finished difference. Result has 217 places, 201 transitions, 478 flow [2024-10-11 17:13:14,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=217, PETRI_TRANSITIONS=201} [2024-10-11 17:13:14,981 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -19 predicate places. [2024-10-11 17:13:14,981 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 201 transitions, 478 flow [2024-10-11 17:13:14,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:14,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:14,982 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] [2024-10-11 17:13:14,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:13:14,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:14,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1694666292, now seen corresponding path program 1 times [2024-10-11 17:13:14,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:14,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253837118] [2024-10-11 17:13:14,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:14,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:15,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:15,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253837118] [2024-10-11 17:13:15,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253837118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:15,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:15,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:15,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862655359] [2024-10-11 17:13:15,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:15,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:15,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259 [2024-10-11 17:13:15,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 201 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:15,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:15,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259 [2024-10-11 17:13:15,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:15,421 INFO L124 PetriNetUnfolderBase]: 746/4032 cut-off events. [2024-10-11 17:13:15,421 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2024-10-11 17:13:15,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5626 conditions, 4032 events. 746/4032 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 40391 event pairs, 276 based on Foata normal form. 0/3540 useless extension candidates. Maximal degree in co-relation 4163. Up to 1027 conditions per place. [2024-10-11 17:13:15,450 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 19 selfloop transitions, 4 changer transitions 0/204 dead transitions. [2024-10-11 17:13:15,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 204 transitions, 533 flow [2024-10-11 17:13:15,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2024-10-11 17:13:15,452 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9266409266409267 [2024-10-11 17:13:15,452 INFO L175 Difference]: Start difference. First operand has 217 places, 201 transitions, 478 flow. Second operand 3 states and 720 transitions. [2024-10-11 17:13:15,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 204 transitions, 533 flow [2024-10-11 17:13:15,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 204 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:15,459 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 495 flow [2024-10-11 17:13:15,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=205, PETRI_TRANSITIONS=201} [2024-10-11 17:13:15,460 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -31 predicate places. [2024-10-11 17:13:15,461 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 495 flow [2024-10-11 17:13:15,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:15,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:15,461 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] [2024-10-11 17:13:15,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:13:15,462 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:15,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1911111425, now seen corresponding path program 1 times [2024-10-11 17:13:15,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:15,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478619697] [2024-10-11 17:13:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:15,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478619697] [2024-10-11 17:13:15,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478619697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:15,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:15,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:15,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405583100] [2024-10-11 17:13:15,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:15,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:15,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:15,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:15,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:15,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259 [2024-10-11 17:13:15,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 201 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:15,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:15,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259 [2024-10-11 17:13:15,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:15,702 INFO L124 PetriNetUnfolderBase]: 203/1313 cut-off events. [2024-10-11 17:13:15,702 INFO L125 PetriNetUnfolderBase]: For 23/35 co-relation queries the response was YES. [2024-10-11 17:13:15,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 1313 events. 203/1313 cut-off events. For 23/35 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 9893 event pairs, 64 based on Foata normal form. 0/1175 useless extension candidates. Maximal degree in co-relation 1269. Up to 174 conditions per place. [2024-10-11 17:13:15,712 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 19 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2024-10-11 17:13:15,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 203 transitions, 544 flow [2024-10-11 17:13:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-10-11 17:13:15,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228 [2024-10-11 17:13:15,714 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 495 flow. Second operand 3 states and 717 transitions. [2024-10-11 17:13:15,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 203 transitions, 544 flow [2024-10-11 17:13:15,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 203 transitions, 544 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:15,718 INFO L231 Difference]: Finished difference. Result has 206 places, 200 transitions, 497 flow [2024-10-11 17:13:15,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=206, PETRI_TRANSITIONS=200} [2024-10-11 17:13:15,719 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -30 predicate places. [2024-10-11 17:13:15,719 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 497 flow [2024-10-11 17:13:15,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:15,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:15,720 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:15,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:13:15,720 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:15,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1146972340, now seen corresponding path program 1 times [2024-10-11 17:13:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:15,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312275536] [2024-10-11 17:13:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:15,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:15,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312275536] [2024-10-11 17:13:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312275536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:15,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:15,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691923342] [2024-10-11 17:13:15,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:15,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:15,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:15,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:15,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259 [2024-10-11 17:13:15,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:15,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:15,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259 [2024-10-11 17:13:15,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:16,022 INFO L124 PetriNetUnfolderBase]: 314/1609 cut-off events. [2024-10-11 17:13:16,023 INFO L125 PetriNetUnfolderBase]: For 88/96 co-relation queries the response was YES. [2024-10-11 17:13:16,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 1609 events. 314/1609 cut-off events. For 88/96 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12797 event pairs, 121 based on Foata normal form. 0/1475 useless extension candidates. Maximal degree in co-relation 2449. Up to 298 conditions per place. [2024-10-11 17:13:16,039 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 18 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2024-10-11 17:13:16,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 202 transitions, 544 flow [2024-10-11 17:13:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-10-11 17:13:16,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253539253539254 [2024-10-11 17:13:16,041 INFO L175 Difference]: Start difference. First operand has 206 places, 200 transitions, 497 flow. Second operand 3 states and 719 transitions. [2024-10-11 17:13:16,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 202 transitions, 544 flow [2024-10-11 17:13:16,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 202 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:16,044 INFO L231 Difference]: Finished difference. Result has 205 places, 199 transitions, 495 flow [2024-10-11 17:13:16,045 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=205, PETRI_TRANSITIONS=199} [2024-10-11 17:13:16,045 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -31 predicate places. [2024-10-11 17:13:16,045 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 199 transitions, 495 flow [2024-10-11 17:13:16,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:16,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:16,046 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] [2024-10-11 17:13:16,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:13:16,047 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:16,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash -126275455, now seen corresponding path program 1 times [2024-10-11 17:13:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447113668] [2024-10-11 17:13:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:16,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:16,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447113668] [2024-10-11 17:13:16,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447113668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:16,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:16,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:16,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71782307] [2024-10-11 17:13:16,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:16,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:16,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:16,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:16,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:16,123 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259 [2024-10-11 17:13:16,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 199 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:16,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:16,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259 [2024-10-11 17:13:16,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:16,270 INFO L124 PetriNetUnfolderBase]: 228/1269 cut-off events. [2024-10-11 17:13:16,270 INFO L125 PetriNetUnfolderBase]: For 95/98 co-relation queries the response was YES. [2024-10-11 17:13:16,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 1269 events. 228/1269 cut-off events. For 95/98 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 9034 event pairs, 80 based on Foata normal form. 0/1172 useless extension candidates. Maximal degree in co-relation 1803. Up to 228 conditions per place. [2024-10-11 17:13:16,285 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 20 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2024-10-11 17:13:16,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 546 flow [2024-10-11 17:13:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-10-11 17:13:16,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228 [2024-10-11 17:13:16,287 INFO L175 Difference]: Start difference. First operand has 205 places, 199 transitions, 495 flow. Second operand 3 states and 717 transitions. [2024-10-11 17:13:16,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 546 flow [2024-10-11 17:13:16,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 201 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:16,290 INFO L231 Difference]: Finished difference. Result has 204 places, 198 transitions, 493 flow [2024-10-11 17:13:16,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=204, PETRI_TRANSITIONS=198} [2024-10-11 17:13:16,291 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -32 predicate places. [2024-10-11 17:13:16,292 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 198 transitions, 493 flow [2024-10-11 17:13:16,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:16,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:16,292 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] [2024-10-11 17:13:16,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:13:16,293 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2024-10-11 17:13:16,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:16,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1685758376, now seen corresponding path program 1 times [2024-10-11 17:13:16,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:16,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943368845] [2024-10-11 17:13:16,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:16,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:16,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:16,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943368845] [2024-10-11 17:13:16,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943368845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:16,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:16,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:16,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415582794] [2024-10-11 17:13:16,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:16,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:16,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:16,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:16,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:16,358 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259 [2024-10-11 17:13:16,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 198 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:16,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:16,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259 [2024-10-11 17:13:16,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:16,500 INFO L124 PetriNetUnfolderBase]: 145/1013 cut-off events. [2024-10-11 17:13:16,500 INFO L125 PetriNetUnfolderBase]: For 75/82 co-relation queries the response was YES. [2024-10-11 17:13:16,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 1013 events. 145/1013 cut-off events. For 75/82 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6559 event pairs, 39 based on Foata normal form. 1/936 useless extension candidates. Maximal degree in co-relation 1332. Up to 128 conditions per place. [2024-10-11 17:13:16,508 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 0 selfloop transitions, 0 changer transitions 200/200 dead transitions. [2024-10-11 17:13:16,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 200 transitions, 540 flow [2024-10-11 17:13:16,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-10-11 17:13:16,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253539253539254 [2024-10-11 17:13:16,510 INFO L175 Difference]: Start difference. First operand has 204 places, 198 transitions, 493 flow. Second operand 3 states and 719 transitions. [2024-10-11 17:13:16,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 200 transitions, 540 flow [2024-10-11 17:13:16,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 200 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:16,513 INFO L231 Difference]: Finished difference. Result has 203 places, 0 transitions, 0 flow [2024-10-11 17:13:16,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=203, PETRI_TRANSITIONS=0} [2024-10-11 17:13:16,515 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -33 predicate places. [2024-10-11 17:13:16,515 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 0 transitions, 0 flow [2024-10-11 17:13:16,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:16,518 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (58 of 59 remaining) [2024-10-11 17:13:16,519 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (57 of 59 remaining) [2024-10-11 17:13:16,519 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (56 of 59 remaining) [2024-10-11 17:13:16,519 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (55 of 59 remaining) [2024-10-11 17:13:16,519 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (54 of 59 remaining) [2024-10-11 17:13:16,519 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 59 remaining) [2024-10-11 17:13:16,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 59 remaining) [2024-10-11 17:13:16,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 59 remaining) [2024-10-11 17:13:16,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (50 of 59 remaining) [2024-10-11 17:13:16,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (49 of 59 remaining) [2024-10-11 17:13:16,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (48 of 59 remaining) [2024-10-11 17:13:16,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (47 of 59 remaining) [2024-10-11 17:13:16,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (46 of 59 remaining) [2024-10-11 17:13:16,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (45 of 59 remaining) [2024-10-11 17:13:16,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (44 of 59 remaining) [2024-10-11 17:13:16,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 59 remaining) [2024-10-11 17:13:16,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 59 remaining) [2024-10-11 17:13:16,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 59 remaining) [2024-10-11 17:13:16,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 59 remaining) [2024-10-11 17:13:16,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 59 remaining) [2024-10-11 17:13:16,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 59 remaining) [2024-10-11 17:13:16,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 59 remaining) [2024-10-11 17:13:16,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 59 remaining) [2024-10-11 17:13:16,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 59 remaining) [2024-10-11 17:13:16,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 59 remaining) [2024-10-11 17:13:16,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 59 remaining) [2024-10-11 17:13:16,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 59 remaining) [2024-10-11 17:13:16,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 59 remaining) [2024-10-11 17:13:16,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 59 remaining) [2024-10-11 17:13:16,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (29 of 59 remaining) [2024-10-11 17:13:16,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 59 remaining) [2024-10-11 17:13:16,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 59 remaining) [2024-10-11 17:13:16,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 59 remaining) [2024-10-11 17:13:16,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 59 remaining) [2024-10-11 17:13:16,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (24 of 59 remaining) [2024-10-11 17:13:16,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (23 of 59 remaining) [2024-10-11 17:13:16,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (22 of 59 remaining) [2024-10-11 17:13:16,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (21 of 59 remaining) [2024-10-11 17:13:16,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (20 of 59 remaining) [2024-10-11 17:13:16,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (19 of 59 remaining) [2024-10-11 17:13:16,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (18 of 59 remaining) [2024-10-11 17:13:16,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (17 of 59 remaining) [2024-10-11 17:13:16,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (16 of 59 remaining) [2024-10-11 17:13:16,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 59 remaining) [2024-10-11 17:13:16,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 59 remaining) [2024-10-11 17:13:16,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 59 remaining) [2024-10-11 17:13:16,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 59 remaining) [2024-10-11 17:13:16,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 59 remaining) [2024-10-11 17:13:16,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 59 remaining) [2024-10-11 17:13:16,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (9 of 59 remaining) [2024-10-11 17:13:16,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (8 of 59 remaining) [2024-10-11 17:13:16,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (7 of 59 remaining) [2024-10-11 17:13:16,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (6 of 59 remaining) [2024-10-11 17:13:16,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (5 of 59 remaining) [2024-10-11 17:13:16,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (4 of 59 remaining) [2024-10-11 17:13:16,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (3 of 59 remaining) [2024-10-11 17:13:16,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 59 remaining) [2024-10-11 17:13:16,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (1 of 59 remaining) [2024-10-11 17:13:16,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (0 of 59 remaining) [2024-10-11 17:13:16,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:13:16,529 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:16,540 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:13:16,540 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:13:16,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:13:16 BasicIcfg [2024-10-11 17:13:16,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:13:16,549 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:13:16,549 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:13:16,549 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:13:16,550 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:12" (3/4) ... [2024-10-11 17:13:16,552 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:13:16,556 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:13:16,556 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:13:16,556 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:13:16,557 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-10-11 17:13:16,564 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 17:13:16,564 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:13:16,564 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 17:13:16,565 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:13:16,647 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:13:16,647 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:13:16,647 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:13:16,648 INFO L158 Benchmark]: Toolchain (without parser) took 4662.55ms. Allocated memory was 144.7MB in the beginning and 346.0MB in the end (delta: 201.3MB). Free memory was 74.5MB in the beginning and 213.9MB in the end (delta: -139.4MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. [2024-10-11 17:13:16,648 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 144.7MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:13:16,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.72ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 74.2MB in the beginning and 165.7MB in the end (delta: -91.5MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-10-11 17:13:16,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.74ms. Allocated memory is still 195.0MB. Free memory was 165.7MB in the beginning and 164.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:13:16,649 INFO L158 Benchmark]: Boogie Preprocessor took 27.24ms. Allocated memory is still 195.0MB. Free memory was 164.6MB in the beginning and 162.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:13:16,649 INFO L158 Benchmark]: RCFGBuilder took 595.37ms. Allocated memory is still 195.0MB. Free memory was 162.5MB in the beginning and 140.5MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 17:13:16,649 INFO L158 Benchmark]: TraceAbstraction took 3590.05ms. Allocated memory was 195.0MB in the beginning and 346.0MB in the end (delta: 151.0MB). Free memory was 139.5MB in the beginning and 220.2MB in the end (delta: -80.7MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2024-10-11 17:13:16,650 INFO L158 Benchmark]: Witness Printer took 98.29ms. Allocated memory is still 346.0MB. Free memory was 220.2MB in the beginning and 213.9MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:13:16,651 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.12ms. Allocated memory is still 144.7MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.72ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 74.2MB in the beginning and 165.7MB in the end (delta: -91.5MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.74ms. Allocated memory is still 195.0MB. Free memory was 165.7MB in the beginning and 164.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.24ms. Allocated memory is still 195.0MB. Free memory was 164.6MB in the beginning and 162.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 595.37ms. Allocated memory is still 195.0MB. Free memory was 162.5MB in the beginning and 140.5MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3590.05ms. Allocated memory was 195.0MB in the beginning and 346.0MB in the end (delta: 151.0MB). Free memory was 139.5MB in the beginning and 220.2MB in the end (delta: -80.7MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. * Witness Printer took 98.29ms. Allocated memory is still 346.0MB. Free memory was 220.2MB in the beginning and 213.9MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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 9 procedures, 342 locations, 59 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: 3.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 681 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 697 IncrementalHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 103 mSDtfsCounter, 697 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=497occurred in iteration=12, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 955 NumberOfCodeBlocks, 955 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 940 ConstructedInterpolants, 0 QuantifiedInterpolants, 970 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:13:16,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE