/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:14:29,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:14:29,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:14:29,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:14:29,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:14:29,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:14:29,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:14:29,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:14:29,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:14:29,552 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:14:29,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:14:29,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:14:29,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:14:29,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:14:29,553 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:14:29,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:14:29,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:14:29,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:14:29,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:14:29,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:14:29,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:14:29,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:14:29,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:14:29,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:14:29,556 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:14:29,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:14:29,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:14:29,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:14:29,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:14:29,787 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:14:29,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c [2025-04-13 20:14:31,076 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215cc936a/1fdc5c303a354c8db1851bbf0cbd1cd1/FLAGee3feceaf [2025-04-13 20:14:31,262 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:14:31,264 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c [2025-04-13 20:14:31,274 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215cc936a/1fdc5c303a354c8db1851bbf0cbd1cd1/FLAGee3feceaf [2025-04-13 20:14:33,126 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215cc936a/1fdc5c303a354c8db1851bbf0cbd1cd1 [2025-04-13 20:14:33,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:14:33,129 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:14:33,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:14:33,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:14:33,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:14:33,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0de4c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33, skipping insertion in model container [2025-04-13 20:14:33,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:14:33,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c[2491,2504] [2025-04-13 20:14:33,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:14:33,314 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:14:33,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c[2491,2504] [2025-04-13 20:14:33,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:14:33,368 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:14:33,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33 WrapperNode [2025-04-13 20:14:33,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:14:33,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:14:33,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:14:33,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:14:33,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,401 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 113 [2025-04-13 20:14:33,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:14:33,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:14:33,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:14:33,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:14:33,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,423 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 20:14:33,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:14:33,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:14:33,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:14:33,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:14:33,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (1/1) ... [2025-04-13 20:14:33,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:14:33,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:14:33,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:14:33,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:14:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:14:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:14:33,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:14:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:14:33,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:14:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:14:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:14:33,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:14:33,475 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:14:33,532 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:14:33,533 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:14:33,683 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:14:33,684 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:14:33,684 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:14:33,782 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:14:33,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:14:33 BoogieIcfgContainer [2025-04-13 20:14:33,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:14:33,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:14:33,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:14:33,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:14:33,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:14:33" (1/3) ... [2025-04-13 20:14:33,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dadf3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:14:33, skipping insertion in model container [2025-04-13 20:14:33,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:14:33" (2/3) ... [2025-04-13 20:14:33,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dadf3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:14:33, skipping insertion in model container [2025-04-13 20:14:33,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:14:33" (3/3) ... [2025-04-13 20:14:33,789 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bluetooth.wvr.c [2025-04-13 20:14:33,799 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:14:33,800 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bluetooth.wvr.c that has 3 procedures, 41 locations, 41 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 20:14:33,800 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:14:33,842 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:14:33,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 100 flow [2025-04-13 20:14:33,900 INFO L116 PetriNetUnfolderBase]: 3/41 cut-off events. [2025-04-13 20:14:33,902 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:14:33,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 3/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-04-13 20:14:33,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 100 flow [2025-04-13 20:14:33,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 40 transitions, 92 flow [2025-04-13 20:14:33,914 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:14:33,923 INFO L340 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;@2a00efc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:14:33,924 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:14:33,936 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:14:33,936 INFO L116 PetriNetUnfolderBase]: 3/39 cut-off events. [2025-04-13 20:14:33,936 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:14:33,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:33,936 INFO L206 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] [2025-04-13 20:14:33,937 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:14:33,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:33,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1950437970, now seen corresponding path program 1 times [2025-04-13 20:14:33,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:33,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86518253] [2025-04-13 20:14:33,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:33,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:33,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 20:14:34,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 20:14:34,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:34,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:34,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:34,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86518253] [2025-04-13 20:14:34,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86518253] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:34,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:34,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:14:34,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694182324] [2025-04-13 20:14:34,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:34,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:14:34,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:34,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:14:34,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:14:34,266 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2025-04-13 20:14:34,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2025-04-13 20:14:34,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:34,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2025-04-13 20:14:34,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:34,411 INFO L116 PetriNetUnfolderBase]: 221/423 cut-off events. [2025-04-13 20:14:34,412 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-13 20:14:34,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 423 events. 221/423 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1639 event pairs, 98 based on Foata normal form. 15/367 useless extension candidates. Maximal degree in co-relation 754. Up to 204 conditions per place. [2025-04-13 20:14:34,418 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 42 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2025-04-13 20:14:34,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 226 flow [2025-04-13 20:14:34,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:14:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:14:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-04-13 20:14:34,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2025-04-13 20:14:34,428 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 92 flow. Second operand 3 states and 84 transitions. [2025-04-13 20:14:34,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 226 flow [2025-04-13 20:14:34,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:14:34,435 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 109 flow [2025-04-13 20:14:34,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2025-04-13 20:14:34,439 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2025-04-13 20:14:34,439 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 109 flow [2025-04-13 20:14:34,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2025-04-13 20:14:34,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:34,440 INFO L206 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] [2025-04-13 20:14:34,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:14:34,440 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:14:34,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:34,440 INFO L85 PathProgramCache]: Analyzing trace with hash -711073393, now seen corresponding path program 1 times [2025-04-13 20:14:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:34,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219220638] [2025-04-13 20:14:34,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:34,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:34,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 20:14:34,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:14:34,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:34,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:34,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219220638] [2025-04-13 20:14:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219220638] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:34,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:34,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:14:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624386908] [2025-04-13 20:14:34,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:34,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:14:34,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:34,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:14:34,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:14:34,532 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-04-13 20:14:34,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2025-04-13 20:14:34,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:34,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-04-13 20:14:34,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:34,638 INFO L116 PetriNetUnfolderBase]: 214/469 cut-off events. [2025-04-13 20:14:34,639 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-13 20:14:34,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 469 events. 214/469 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2104 event pairs, 58 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 519. Up to 257 conditions per place. [2025-04-13 20:14:34,644 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 36 selfloop transitions, 7 changer transitions 2/59 dead transitions. [2025-04-13 20:14:34,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 238 flow [2025-04-13 20:14:34,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:14:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:14:34,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-04-13 20:14:34,646 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2025-04-13 20:14:34,646 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 109 flow. Second operand 3 states and 89 transitions. [2025-04-13 20:14:34,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 238 flow [2025-04-13 20:14:34,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:14:34,649 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 145 flow [2025-04-13 20:14:34,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-04-13 20:14:34,650 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-04-13 20:14:34,650 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 145 flow [2025-04-13 20:14:34,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2025-04-13 20:14:34,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:34,650 INFO L206 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] [2025-04-13 20:14:34,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:14:34,650 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:14:34,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1260948771, now seen corresponding path program 2 times [2025-04-13 20:14:34,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:34,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112588561] [2025-04-13 20:14:34,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:14:34,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:34,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 1 equivalence classes. [2025-04-13 20:14:34,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:14:34,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:14:34,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:34,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:34,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112588561] [2025-04-13 20:14:34,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112588561] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:34,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:34,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:14:34,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798208148] [2025-04-13 20:14:34,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:34,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:14:34,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:34,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:14:34,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:14:34,840 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-04-13 20:14:34,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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) [2025-04-13 20:14:34,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:34,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-04-13 20:14:34,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:35,007 INFO L116 PetriNetUnfolderBase]: 275/634 cut-off events. [2025-04-13 20:14:35,007 INFO L117 PetriNetUnfolderBase]: For 157/180 co-relation queries the response was YES. [2025-04-13 20:14:35,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 634 events. 275/634 cut-off events. For 157/180 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3343 event pairs, 27 based on Foata normal form. 47/662 useless extension candidates. Maximal degree in co-relation 1021. Up to 174 conditions per place. [2025-04-13 20:14:35,014 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 54 selfloop transitions, 18 changer transitions 11/97 dead transitions. [2025-04-13 20:14:35,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 97 transitions, 483 flow [2025-04-13 20:14:35,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:14:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:14:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2025-04-13 20:14:35,016 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6356589147286822 [2025-04-13 20:14:35,016 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 145 flow. Second operand 6 states and 164 transitions. [2025-04-13 20:14:35,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 97 transitions, 483 flow [2025-04-13 20:14:35,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 97 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:14:35,021 INFO L231 Difference]: Finished difference. Result has 54 places, 59 transitions, 294 flow [2025-04-13 20:14:35,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=54, PETRI_TRANSITIONS=59} [2025-04-13 20:14:35,022 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2025-04-13 20:14:35,022 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 59 transitions, 294 flow [2025-04-13 20:14:35,022 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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) [2025-04-13 20:14:35,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:35,022 INFO L206 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] [2025-04-13 20:14:35,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:14:35,022 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:14:35,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:35,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2057754216, now seen corresponding path program 1 times [2025-04-13 20:14:35,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:35,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480329462] [2025-04-13 20:14:35,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:35,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:35,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 20:14:35,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:14:35,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:35,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:35,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480329462] [2025-04-13 20:14:35,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480329462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:35,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:35,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:14:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893489602] [2025-04-13 20:14:35,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:35,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:14:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:35,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:14:35,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:14:35,198 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2025-04-13 20:14:35,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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) [2025-04-13 20:14:35,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:35,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2025-04-13 20:14:35,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:35,323 INFO L116 PetriNetUnfolderBase]: 315/725 cut-off events. [2025-04-13 20:14:35,323 INFO L117 PetriNetUnfolderBase]: For 680/690 co-relation queries the response was YES. [2025-04-13 20:14:35,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 725 events. 315/725 cut-off events. For 680/690 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3936 event pairs, 203 based on Foata normal form. 2/704 useless extension candidates. Maximal degree in co-relation 1573. Up to 479 conditions per place. [2025-04-13 20:14:35,326 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 44 selfloop transitions, 0 changer transitions 26/83 dead transitions. [2025-04-13 20:14:35,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 556 flow [2025-04-13 20:14:35,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:14:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:14:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-04-13 20:14:35,327 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5988372093023255 [2025-04-13 20:14:35,327 INFO L175 Difference]: Start difference. First operand has 54 places, 59 transitions, 294 flow. Second operand 4 states and 103 transitions. [2025-04-13 20:14:35,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 556 flow [2025-04-13 20:14:35,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 20:14:35,332 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 288 flow [2025-04-13 20:14:35,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-04-13 20:14:35,334 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2025-04-13 20:14:35,335 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 288 flow [2025-04-13 20:14:35,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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) [2025-04-13 20:14:35,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:14:35,335 INFO L206 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] [2025-04-13 20:14:35,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:14:35,335 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:14:35,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:14:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash 464114469, now seen corresponding path program 1 times [2025-04-13 20:14:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:14:35,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526269864] [2025-04-13 20:14:35,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:14:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:14:35,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 20:14:35,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 20:14:35,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:14:35,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:14:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:14:35,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:14:35,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526269864] [2025-04-13 20:14:35,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526269864] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:14:35,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:14:35,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:14:35,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19777020] [2025-04-13 20:14:35,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:14:35,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:14:35,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:14:35,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:14:35,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:14:35,592 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-04-13 20:14:35,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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) [2025-04-13 20:14:35,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:14:35,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-04-13 20:14:35,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:14:35,742 INFO L116 PetriNetUnfolderBase]: 272/580 cut-off events. [2025-04-13 20:14:35,743 INFO L117 PetriNetUnfolderBase]: For 584/594 co-relation queries the response was YES. [2025-04-13 20:14:35,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 580 events. 272/580 cut-off events. For 584/594 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2773 event pairs, 46 based on Foata normal form. 6/581 useless extension candidates. Maximal degree in co-relation 1735. Up to 339 conditions per place. [2025-04-13 20:14:35,745 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 0 selfloop transitions, 0 changer transitions 85/85 dead transitions. [2025-04-13 20:14:35,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 85 transitions, 581 flow [2025-04-13 20:14:35,746 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:14:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:14:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2025-04-13 20:14:35,747 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2025-04-13 20:14:35,747 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 288 flow. Second operand 7 states and 131 transitions. [2025-04-13 20:14:35,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 85 transitions, 581 flow [2025-04-13 20:14:35,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 571 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-13 20:14:35,751 INFO L231 Difference]: Finished difference. Result has 61 places, 0 transitions, 0 flow [2025-04-13 20:14:35,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=61, PETRI_TRANSITIONS=0} [2025-04-13 20:14:35,752 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2025-04-13 20:14:35,752 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 0 transitions, 0 flow [2025-04-13 20:14:35,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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) [2025-04-13 20:14:35,754 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 20:14:35,754 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 20:14:35,754 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 20:14:35,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:14:35,754 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-04-13 20:14:35,759 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:14:35,759 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:14:35,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:14:35 BasicIcfg [2025-04-13 20:14:35,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:14:35,764 INFO L158 Benchmark]: Toolchain (without parser) took 2635.20ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 78.7MB in the end (delta: 26.3MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2025-04-13 20:14:35,765 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:14:35,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.10ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 90.4MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 20:14:35,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.18ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 89.1MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:14:35,765 INFO L158 Benchmark]: Boogie Preprocessor took 29.43ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:14:35,766 INFO L158 Benchmark]: RCFGBuilder took 351.68ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 54.6MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 20:14:35,766 INFO L158 Benchmark]: TraceAbstraction took 1979.51ms. Allocated memory is still 142.6MB. Free memory was 53.7MB in the beginning and 78.7MB in the end (delta: -25.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:14:35,767 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.10ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 90.4MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.18ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 89.1MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.43ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 351.68ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 54.6MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1979.51ms. Allocated memory is still 142.6MB. Free memory was 53.7MB in the beginning and 78.7MB in the end (delta: -25.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 62 locations, 67 edges, 3 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.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 456 IncrementalHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 8 mSDtfsCounter, 456 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 20:14:35,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...