./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/chl-sre-subst.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/chl-sre-subst.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 3f15efb4f8a286b7a1ad39e3d0e5f0f11fbc70672e37c5d5b49fafb43ac86a5c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:14:47,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:14:47,356 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:14:47,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:14:47,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:14:47,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:14:47,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:14:47,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:14:47,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:14:47,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:14:47,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:14:47,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:14:47,378 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:14:47,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:14:47,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:14:47,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:14:47,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:14:47,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:14:47,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:14:47,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:14:47,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:14:47,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:14:47,383 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:14:47,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:14:47,383 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:14:47,383 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:14:47,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:14:47,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:14:47,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:14:47,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:14:47,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:14:47,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:14:47,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:14:47,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:14:47,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:14:47,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:14:47,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:14:47,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:14:47,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:14:47,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:14:47,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:14:47,387 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 -> 3f15efb4f8a286b7a1ad39e3d0e5f0f11fbc70672e37c5d5b49fafb43ac86a5c [2024-10-11 17:14:47,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:14:47,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:14:47,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:14:47,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:14:47,621 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:14:47,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-sre-subst.wvr.c [2024-10-11 17:14:48,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:14:49,072 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:14:49,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-sre-subst.wvr.c [2024-10-11 17:14:49,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/db77e1252/de73f86af0a843e789473ce1dab88ecb/FLAGe11ded0f5 [2024-10-11 17:14:49,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/db77e1252/de73f86af0a843e789473ce1dab88ecb [2024-10-11 17:14:49,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:14:49,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:14:49,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:14:49,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:14:49,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:14:49,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:14:49" (1/1) ... [2024-10-11 17:14:49,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5773cc26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49, skipping insertion in model container [2024-10-11 17:14:49,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:14:49" (1/1) ... [2024-10-11 17:14:49,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:14:49,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:14:49,291 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:14:49,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:14:49,320 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:14:49,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49 WrapperNode [2024-10-11 17:14:49,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:14:49,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:14:49,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:14:49,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:14:49,327 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:14:49" (1/1) ... [2024-10-11 17:14:49,333 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:14:49" (1/1) ... [2024-10-11 17:14:49,347 INFO L138 Inliner]: procedures = 21, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 89 [2024-10-11 17:14:49,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:14:49,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:14:49,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:14:49,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:14:49,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49" (1/1) ... [2024-10-11 17:14:49,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49" (1/1) ... [2024-10-11 17:14:49,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49" (1/1) ... [2024-10-11 17:14:49,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49" (1/1) ... [2024-10-11 17:14:49,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49" (1/1) ... [2024-10-11 17:14:49,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49" (1/1) ... [2024-10-11 17:14:49,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49" (1/1) ... [2024-10-11 17:14:49,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49" (1/1) ... [2024-10-11 17:14:49,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:14:49,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:14:49,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:14:49,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:14:49,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49" (1/1) ... [2024-10-11 17:14:49,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:14:49,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:14:49,405 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:14:49,406 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:14:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:14:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:14:49,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:14:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:14:49,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:14:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:14:49,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:14:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:14:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:14:49,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:14:49,440 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:14:49,516 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:14:49,517 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:14:49,705 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:14:49,706 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:14:49,723 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:14:49,723 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:14:49,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:49 BoogieIcfgContainer [2024-10-11 17:14:49,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:14:49,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:14:49,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:14:49,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:14:49,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:14:49" (1/3) ... [2024-10-11 17:14:49,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a40455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:14:49, skipping insertion in model container [2024-10-11 17:14:49,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:14:49" (2/3) ... [2024-10-11 17:14:49,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a40455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:14:49, skipping insertion in model container [2024-10-11 17:14:49,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:49" (3/3) ... [2024-10-11 17:14:49,730 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-sre-subst.wvr.c [2024-10-11 17:14:49,743 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:14:49,744 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-11 17:14:49,744 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:14:49,862 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:14:49,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 181 transitions, 383 flow [2024-10-11 17:14:49,976 INFO L124 PetriNetUnfolderBase]: 6/178 cut-off events. [2024-10-11 17:14:49,977 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:14:49,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 178 events. 6/178 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 250 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2024-10-11 17:14:49,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 181 transitions, 383 flow [2024-10-11 17:14:49,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 158 transitions, 334 flow [2024-10-11 17:14:49,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:14:50,000 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;@2f62c023, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:14:50,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-10-11 17:14:50,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:14:50,006 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-11 17:14:50,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:14:50,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:50,007 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] [2024-10-11 17:14:50,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:50,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:50,018 INFO L85 PathProgramCache]: Analyzing trace with hash -216439581, now seen corresponding path program 1 times [2024-10-11 17:14:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131032018] [2024-10-11 17:14:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:50,188 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:14:50,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:50,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131032018] [2024-10-11 17:14:50,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131032018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:50,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:50,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:50,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380548915] [2024-10-11 17:14:50,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:50,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:50,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:50,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 181 [2024-10-11 17:14:50,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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:14:50,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:50,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 181 [2024-10-11 17:14:50,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:50,313 INFO L124 PetriNetUnfolderBase]: 16/295 cut-off events. [2024-10-11 17:14:50,313 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-11 17:14:50,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 295 events. 16/295 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 979 event pairs, 7 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 226. Up to 25 conditions per place. [2024-10-11 17:14:50,318 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 11 selfloop transitions, 2 changer transitions 1/156 dead transitions. [2024-10-11 17:14:50,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 156 transitions, 356 flow [2024-10-11 17:14:50,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2024-10-11 17:14:50,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9281767955801105 [2024-10-11 17:14:50,334 INFO L175 Difference]: Start difference. First operand has 164 places, 158 transitions, 334 flow. Second operand 3 states and 504 transitions. [2024-10-11 17:14:50,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 156 transitions, 356 flow [2024-10-11 17:14:50,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 156 transitions, 344 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:14:50,342 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 320 flow [2024-10-11 17:14:50,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=159, PETRI_TRANSITIONS=155} [2024-10-11 17:14:50,347 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -5 predicate places. [2024-10-11 17:14:50,347 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 320 flow [2024-10-11 17:14:50,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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:14:50,348 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:50,348 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:50,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:14:50,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:50,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash 724321985, now seen corresponding path program 1 times [2024-10-11 17:14:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052346771] [2024-10-11 17:14:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:50,399 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:14:50,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:50,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052346771] [2024-10-11 17:14:50,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052346771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:50,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:50,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:50,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572962516] [2024-10-11 17:14:50,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:50,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:50,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:50,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 181 [2024-10-11 17:14:50,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:14:50,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:50,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 181 [2024-10-11 17:14:50,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:50,468 INFO L124 PetriNetUnfolderBase]: 14/221 cut-off events. [2024-10-11 17:14:50,468 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:14:50,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 221 events. 14/221 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 597 event pairs, 8 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 232. Up to 29 conditions per place. [2024-10-11 17:14:50,472 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 12 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2024-10-11 17:14:50,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 154 transitions, 346 flow [2024-10-11 17:14:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2024-10-11 17:14:50,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9226519337016574 [2024-10-11 17:14:50,475 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 320 flow. Second operand 3 states and 501 transitions. [2024-10-11 17:14:50,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 154 transitions, 346 flow [2024-10-11 17:14:50,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 154 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:50,482 INFO L231 Difference]: Finished difference. Result has 157 places, 154 transitions, 318 flow [2024-10-11 17:14:50,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=157, PETRI_TRANSITIONS=154} [2024-10-11 17:14:50,483 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -7 predicate places. [2024-10-11 17:14:50,483 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 154 transitions, 318 flow [2024-10-11 17:14:50,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:14:50,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:50,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:50,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:14:50,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:50,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1190117104, now seen corresponding path program 1 times [2024-10-11 17:14:50,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:50,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701224655] [2024-10-11 17:14:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:50,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:50,549 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:14:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:50,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701224655] [2024-10-11 17:14:50,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701224655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:50,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:50,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:50,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562284112] [2024-10-11 17:14:50,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:50,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:50,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:50,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:50,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 181 [2024-10-11 17:14:50,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 154 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:14:50,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:50,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 181 [2024-10-11 17:14:50,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:50,619 INFO L124 PetriNetUnfolderBase]: 27/257 cut-off events. [2024-10-11 17:14:50,620 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2024-10-11 17:14:50,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 257 events. 27/257 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 877 event pairs, 20 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 279. Up to 50 conditions per place. [2024-10-11 17:14:50,624 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 13 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2024-10-11 17:14:50,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 153 transitions, 346 flow [2024-10-11 17:14:50,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:50,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2024-10-11 17:14:50,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9189686924493554 [2024-10-11 17:14:50,626 INFO L175 Difference]: Start difference. First operand has 157 places, 154 transitions, 318 flow. Second operand 3 states and 499 transitions. [2024-10-11 17:14:50,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 153 transitions, 346 flow [2024-10-11 17:14:50,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 153 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:50,630 INFO L231 Difference]: Finished difference. Result has 156 places, 153 transitions, 316 flow [2024-10-11 17:14:50,632 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=156, PETRI_TRANSITIONS=153} [2024-10-11 17:14:50,633 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -8 predicate places. [2024-10-11 17:14:50,633 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 316 flow [2024-10-11 17:14:50,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:14:50,633 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:50,633 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:50,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:14:50,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:50,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1272458205, now seen corresponding path program 1 times [2024-10-11 17:14:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:50,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007858266] [2024-10-11 17:14:50,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:50,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:50,694 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:14:50,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:50,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007858266] [2024-10-11 17:14:50,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007858266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:50,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:50,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012467093] [2024-10-11 17:14:50,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:50,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:50,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:50,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:50,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 181 [2024-10-11 17:14:50,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:14:50,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:50,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 181 [2024-10-11 17:14:50,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:50,765 INFO L124 PetriNetUnfolderBase]: 34/414 cut-off events. [2024-10-11 17:14:50,765 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:14:50,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 414 events. 34/414 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1986 event pairs, 13 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 432. Up to 43 conditions per place. [2024-10-11 17:14:50,767 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 13 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-10-11 17:14:50,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 155 transitions, 352 flow [2024-10-11 17:14:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2024-10-11 17:14:50,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9429097605893186 [2024-10-11 17:14:50,769 INFO L175 Difference]: Start difference. First operand has 156 places, 153 transitions, 316 flow. Second operand 3 states and 512 transitions. [2024-10-11 17:14:50,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 155 transitions, 352 flow [2024-10-11 17:14:50,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 155 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:50,772 INFO L231 Difference]: Finished difference. Result has 155 places, 153 transitions, 322 flow [2024-10-11 17:14:50,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=155, PETRI_TRANSITIONS=153} [2024-10-11 17:14:50,772 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -9 predicate places. [2024-10-11 17:14:50,773 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 153 transitions, 322 flow [2024-10-11 17:14:50,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:14:50,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:50,773 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:14:50,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:14:50,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:50,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1233357701, now seen corresponding path program 1 times [2024-10-11 17:14:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:50,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537326854] [2024-10-11 17:14:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:50,830 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:14:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:50,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537326854] [2024-10-11 17:14:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537326854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:50,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:50,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:50,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893907510] [2024-10-11 17:14:50,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:50,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:50,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:50,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:50,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 181 [2024-10-11 17:14:50,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 153 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:14:50,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:50,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 181 [2024-10-11 17:14:50,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:50,889 INFO L124 PetriNetUnfolderBase]: 32/331 cut-off events. [2024-10-11 17:14:50,889 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 17:14:50,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 331 events. 32/331 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1301 event pairs, 10 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 324. Up to 49 conditions per place. [2024-10-11 17:14:50,893 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 15 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2024-10-11 17:14:50,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 154 transitions, 360 flow [2024-10-11 17:14:50,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-10-11 17:14:50,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9318600368324125 [2024-10-11 17:14:50,894 INFO L175 Difference]: Start difference. First operand has 155 places, 153 transitions, 322 flow. Second operand 3 states and 506 transitions. [2024-10-11 17:14:50,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 154 transitions, 360 flow [2024-10-11 17:14:50,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 154 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:50,896 INFO L231 Difference]: Finished difference. Result has 155 places, 152 transitions, 330 flow [2024-10-11 17:14:50,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=155, PETRI_TRANSITIONS=152} [2024-10-11 17:14:50,898 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -9 predicate places. [2024-10-11 17:14:50,898 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 152 transitions, 330 flow [2024-10-11 17:14:50,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:14:50,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:50,899 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:14:50,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:14:50,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:50,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1149712630, now seen corresponding path program 1 times [2024-10-11 17:14:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:50,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178194051] [2024-10-11 17:14:50,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:50,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:50,949 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:14:50,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:50,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178194051] [2024-10-11 17:14:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178194051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:50,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:50,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260362541] [2024-10-11 17:14:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:50,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:50,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:50,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:50,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:50,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 181 [2024-10-11 17:14:50,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 152 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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:14:50,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:50,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 181 [2024-10-11 17:14:50,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:51,039 INFO L124 PetriNetUnfolderBase]: 131/680 cut-off events. [2024-10-11 17:14:51,039 INFO L125 PetriNetUnfolderBase]: For 31/36 co-relation queries the response was YES. [2024-10-11 17:14:51,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 680 events. 131/680 cut-off events. For 31/36 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4166 event pairs, 52 based on Foata normal form. 1/606 useless extension candidates. Maximal degree in co-relation 669. Up to 202 conditions per place. [2024-10-11 17:14:51,044 INFO L140 encePairwiseOnDemand]: 175/181 looper letters, 17 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2024-10-11 17:14:51,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 152 transitions, 370 flow [2024-10-11 17:14:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2024-10-11 17:14:51,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9208103130755064 [2024-10-11 17:14:51,046 INFO L175 Difference]: Start difference. First operand has 155 places, 152 transitions, 330 flow. Second operand 3 states and 500 transitions. [2024-10-11 17:14:51,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 152 transitions, 370 flow [2024-10-11 17:14:51,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 152 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:51,049 INFO L231 Difference]: Finished difference. Result has 154 places, 150 transitions, 336 flow [2024-10-11 17:14:51,049 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=154, PETRI_TRANSITIONS=150} [2024-10-11 17:14:51,049 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -10 predicate places. [2024-10-11 17:14:51,050 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 150 transitions, 336 flow [2024-10-11 17:14:51,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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:14:51,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:51,051 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:14:51,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:14:51,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:51,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:51,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1036086572, now seen corresponding path program 1 times [2024-10-11 17:14:51,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:51,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168004164] [2024-10-11 17:14:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:51,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:51,089 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:14:51,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:51,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168004164] [2024-10-11 17:14:51,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168004164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:51,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:51,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:51,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437600401] [2024-10-11 17:14:51,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:51,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:51,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:51,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:51,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:51,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 181 [2024-10-11 17:14:51,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 150 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:14:51,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:51,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 181 [2024-10-11 17:14:51,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:51,137 INFO L124 PetriNetUnfolderBase]: 25/324 cut-off events. [2024-10-11 17:14:51,137 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:14:51,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 324 events. 25/324 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1308 event pairs, 4 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 300. Up to 18 conditions per place. [2024-10-11 17:14:51,139 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 11 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2024-10-11 17:14:51,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 151 transitions, 366 flow [2024-10-11 17:14:51,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2024-10-11 17:14:51,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9429097605893186 [2024-10-11 17:14:51,157 INFO L175 Difference]: Start difference. First operand has 154 places, 150 transitions, 336 flow. Second operand 3 states and 512 transitions. [2024-10-11 17:14:51,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 151 transitions, 366 flow [2024-10-11 17:14:51,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 151 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:51,160 INFO L231 Difference]: Finished difference. Result has 155 places, 149 transitions, 338 flow [2024-10-11 17:14:51,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=155, PETRI_TRANSITIONS=149} [2024-10-11 17:14:51,161 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -9 predicate places. [2024-10-11 17:14:51,162 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 149 transitions, 338 flow [2024-10-11 17:14:51,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:14:51,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:51,162 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:14:51,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:14:51,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:51,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:51,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1472827793, now seen corresponding path program 1 times [2024-10-11 17:14:51,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:51,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631160783] [2024-10-11 17:14:51,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:51,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:51,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:51,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631160783] [2024-10-11 17:14:51,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631160783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:51,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:51,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:51,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707364180] [2024-10-11 17:14:51,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:51,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:51,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:51,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:51,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:51,217 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 181 [2024-10-11 17:14:51,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 149 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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:14:51,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:51,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 181 [2024-10-11 17:14:51,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:51,256 INFO L124 PetriNetUnfolderBase]: 29/332 cut-off events. [2024-10-11 17:14:51,257 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2024-10-11 17:14:51,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 332 events. 29/332 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1405 event pairs, 6 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 363. Up to 25 conditions per place. [2024-10-11 17:14:51,259 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 12 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2024-10-11 17:14:51,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 150 transitions, 370 flow [2024-10-11 17:14:51,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2024-10-11 17:14:51,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392265193370166 [2024-10-11 17:14:51,261 INFO L175 Difference]: Start difference. First operand has 155 places, 149 transitions, 338 flow. Second operand 3 states and 510 transitions. [2024-10-11 17:14:51,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 150 transitions, 370 flow [2024-10-11 17:14:51,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 150 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:51,264 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 336 flow [2024-10-11 17:14:51,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2024-10-11 17:14:51,266 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -10 predicate places. [2024-10-11 17:14:51,266 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 336 flow [2024-10-11 17:14:51,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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:14:51,266 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:51,267 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:51,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:14:51,267 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:51,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash 949873319, now seen corresponding path program 1 times [2024-10-11 17:14:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226353189] [2024-10-11 17:14:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:51,304 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:14:51,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:51,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226353189] [2024-10-11 17:14:51,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226353189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:51,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:51,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:51,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551767053] [2024-10-11 17:14:51,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:51,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:51,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:51,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:51,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:51,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 181 [2024-10-11 17:14:51,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:51,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:51,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 181 [2024-10-11 17:14:51,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:51,356 INFO L124 PetriNetUnfolderBase]: 25/261 cut-off events. [2024-10-11 17:14:51,357 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2024-10-11 17:14:51,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 261 events. 25/261 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 838 event pairs, 6 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 285. Up to 31 conditions per place. [2024-10-11 17:14:51,358 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 12 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2024-10-11 17:14:51,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 149 transitions, 368 flow [2024-10-11 17:14:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2024-10-11 17:14:51,360 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392265193370166 [2024-10-11 17:14:51,360 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 336 flow. Second operand 3 states and 510 transitions. [2024-10-11 17:14:51,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 149 transitions, 368 flow [2024-10-11 17:14:51,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 149 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:51,363 INFO L231 Difference]: Finished difference. Result has 153 places, 147 transitions, 334 flow [2024-10-11 17:14:51,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=153, PETRI_TRANSITIONS=147} [2024-10-11 17:14:51,365 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -11 predicate places. [2024-10-11 17:14:51,365 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 147 transitions, 334 flow [2024-10-11 17:14:51,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:14:51,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:51,365 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:51,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:14:51,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:51,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash 240927430, now seen corresponding path program 1 times [2024-10-11 17:14:51,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:51,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445949217] [2024-10-11 17:14:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:51,425 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:14:51,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:51,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445949217] [2024-10-11 17:14:51,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445949217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:51,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:51,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:51,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47068491] [2024-10-11 17:14:51,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:51,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:51,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:51,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:51,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:51,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 181 [2024-10-11 17:14:51,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 147 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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:14:51,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:51,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 181 [2024-10-11 17:14:51,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:51,462 INFO L124 PetriNetUnfolderBase]: 19/295 cut-off events. [2024-10-11 17:14:51,463 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-11 17:14:51,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 295 events. 19/295 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1048 event pairs, 2 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 280. Up to 14 conditions per place. [2024-10-11 17:14:51,464 INFO L140 encePairwiseOnDemand]: 179/181 looper letters, 8 selfloop transitions, 1 changer transitions 0/146 dead transitions. [2024-10-11 17:14:51,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 146 transitions, 350 flow [2024-10-11 17:14:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2024-10-11 17:14:51,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9465930018416207 [2024-10-11 17:14:51,466 INFO L175 Difference]: Start difference. First operand has 153 places, 147 transitions, 334 flow. Second operand 3 states and 514 transitions. [2024-10-11 17:14:51,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 146 transitions, 350 flow [2024-10-11 17:14:51,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 146 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:51,468 INFO L231 Difference]: Finished difference. Result has 152 places, 146 transitions, 330 flow [2024-10-11 17:14:51,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=152, PETRI_TRANSITIONS=146} [2024-10-11 17:14:51,469 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -12 predicate places. [2024-10-11 17:14:51,469 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 146 transitions, 330 flow [2024-10-11 17:14:51,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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:14:51,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:51,470 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:51,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:14:51,470 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:51,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:51,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1674559677, now seen corresponding path program 1 times [2024-10-11 17:14:51,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:51,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866781015] [2024-10-11 17:14:51,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:51,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:51,523 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:14:51,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:51,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866781015] [2024-10-11 17:14:51,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866781015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:51,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:51,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:51,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257723443] [2024-10-11 17:14:51,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:51,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:51,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:51,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:51,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:51,549 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 181 [2024-10-11 17:14:51,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 146 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:14:51,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:51,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 181 [2024-10-11 17:14:51,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:51,587 INFO L124 PetriNetUnfolderBase]: 20/294 cut-off events. [2024-10-11 17:14:51,587 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-11 17:14:51,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 294 events. 20/294 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1052 event pairs, 3 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 329. Up to 16 conditions per place. [2024-10-11 17:14:51,590 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 10 selfloop transitions, 1 changer transitions 0/144 dead transitions. [2024-10-11 17:14:51,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 348 flow [2024-10-11 17:14:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2024-10-11 17:14:51,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9355432780847146 [2024-10-11 17:14:51,591 INFO L175 Difference]: Start difference. First operand has 152 places, 146 transitions, 330 flow. Second operand 3 states and 508 transitions. [2024-10-11 17:14:51,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 348 flow [2024-10-11 17:14:51,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 144 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:14:51,593 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 327 flow [2024-10-11 17:14:51,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2024-10-11 17:14:51,594 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -13 predicate places. [2024-10-11 17:14:51,594 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 327 flow [2024-10-11 17:14:51,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:14:51,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:51,595 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:51,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:14:51,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2024-10-11 17:14:51,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:51,595 INFO L85 PathProgramCache]: Analyzing trace with hash -636424360, now seen corresponding path program 1 times [2024-10-11 17:14:51,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:51,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645345515] [2024-10-11 17:14:51,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:51,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:51,638 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:14:51,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645345515] [2024-10-11 17:14:51,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645345515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:51,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:51,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:51,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717104705] [2024-10-11 17:14:51,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:51,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:51,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:51,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:51,650 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 181 [2024-10-11 17:14:51,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:14:51,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:51,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 181 [2024-10-11 17:14:51,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:51,681 INFO L124 PetriNetUnfolderBase]: 16/231 cut-off events. [2024-10-11 17:14:51,681 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-11 17:14:51,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 231 events. 16/231 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 670 event pairs, 3 based on Foata normal form. 1/221 useless extension candidates. Maximal degree in co-relation 269. Up to 18 conditions per place. [2024-10-11 17:14:51,682 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 0 selfloop transitions, 0 changer transitions 142/142 dead transitions. [2024-10-11 17:14:51,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 142 transitions, 343 flow [2024-10-11 17:14:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2024-10-11 17:14:51,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9337016574585635 [2024-10-11 17:14:51,684 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 327 flow. Second operand 3 states and 507 transitions. [2024-10-11 17:14:51,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 142 transitions, 343 flow [2024-10-11 17:14:51,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 142 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:14:51,685 INFO L231 Difference]: Finished difference. Result has 150 places, 0 transitions, 0 flow [2024-10-11 17:14:51,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=150, PETRI_TRANSITIONS=0} [2024-10-11 17:14:51,686 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, -14 predicate places. [2024-10-11 17:14:51,686 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 0 transitions, 0 flow [2024-10-11 17:14:51,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:14:51,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2024-10-11 17:14:51,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2024-10-11 17:14:51,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2024-10-11 17:14:51,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2024-10-11 17:14:51,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2024-10-11 17:14:51,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2024-10-11 17:14:51,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2024-10-11 17:14:51,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2024-10-11 17:14:51,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2024-10-11 17:14:51,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2024-10-11 17:14:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2024-10-11 17:14:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2024-10-11 17:14:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2024-10-11 17:14:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2024-10-11 17:14:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2024-10-11 17:14:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2024-10-11 17:14:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2024-10-11 17:14:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2024-10-11 17:14:51,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2024-10-11 17:14:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2024-10-11 17:14:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2024-10-11 17:14:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 35 remaining) [2024-10-11 17:14:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 35 remaining) [2024-10-11 17:14:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2024-10-11 17:14:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2024-10-11 17:14:51,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2024-10-11 17:14:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2024-10-11 17:14:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2024-10-11 17:14:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2024-10-11 17:14:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2024-10-11 17:14:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2024-10-11 17:14:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2024-10-11 17:14:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2024-10-11 17:14:51,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2024-10-11 17:14:51,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2024-10-11 17:14:51,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:14:51,694 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:51,699 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:14:51,699 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:14:51,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:14:51 BasicIcfg [2024-10-11 17:14:51,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:14:51,706 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:14:51,706 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:14:51,706 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:14:51,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:14:49" (3/4) ... [2024-10-11 17:14:51,708 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:14:51,713 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:14:51,713 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:14:51,713 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:14:51,717 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-11 17:14:51,718 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:14:51,718 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:14:51,719 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:14:51,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:14:51,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:14:51,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:14:51,796 INFO L158 Benchmark]: Toolchain (without parser) took 2702.38ms. Allocated memory was 188.7MB in the beginning and 260.0MB in the end (delta: 71.3MB). Free memory was 118.3MB in the beginning and 171.6MB in the end (delta: -53.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-10-11 17:14:51,796 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory was 83.4MB in the beginning and 83.2MB in the end (delta: 157.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:14:51,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.72ms. Allocated memory is still 188.7MB. Free memory was 118.3MB in the beginning and 105.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 17:14:51,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.55ms. Allocated memory is still 188.7MB. Free memory was 105.2MB in the beginning and 103.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:14:51,797 INFO L158 Benchmark]: Boogie Preprocessor took 28.21ms. Allocated memory is still 188.7MB. Free memory was 103.4MB in the beginning and 102.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:14:51,797 INFO L158 Benchmark]: RCFGBuilder took 346.19ms. Allocated memory is still 188.7MB. Free memory was 102.2MB in the beginning and 84.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 17:14:51,797 INFO L158 Benchmark]: TraceAbstraction took 1980.40ms. Allocated memory was 188.7MB in the beginning and 260.0MB in the end (delta: 71.3MB). Free memory was 83.3MB in the beginning and 177.9MB in the end (delta: -94.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:14:51,797 INFO L158 Benchmark]: Witness Printer took 89.31ms. Allocated memory is still 260.0MB. Free memory was 176.9MB in the beginning and 171.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:14:51,800 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.13ms. Allocated memory is still 121.6MB. Free memory was 83.4MB in the beginning and 83.2MB in the end (delta: 157.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.72ms. Allocated memory is still 188.7MB. Free memory was 118.3MB in the beginning and 105.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.55ms. Allocated memory is still 188.7MB. Free memory was 105.2MB in the beginning and 103.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.21ms. Allocated memory is still 188.7MB. Free memory was 103.4MB in the beginning and 102.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 346.19ms. Allocated memory is still 188.7MB. Free memory was 102.2MB in the beginning and 84.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1980.40ms. Allocated memory was 188.7MB in the beginning and 260.0MB in the end (delta: 71.3MB). Free memory was 83.3MB in the beginning and 177.9MB in the end (delta: -94.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 89.31ms. Allocated memory is still 260.0MB. Free memory was 176.9MB in the beginning and 171.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: 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: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 76]: 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: 76]: 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 7 procedures, 248 locations, 35 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: 1.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 316 IncrementalHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 56 mSDtfsCounter, 316 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:14:51,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE