/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/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:40:00,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:40:00,473 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 19:40:00,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:40:00,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:40:00,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:40:00,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:40:00,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:40:00,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:40:00,504 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:40:00,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:40:00,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:40:00,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:40:00,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:40:00,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:40:00,505 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:40:00,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:40:00,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:40:00,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:40:00,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:40:00,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:00,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:40:00,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:40:00,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:40:00,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:40:00,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:00,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:40:00,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:40:00,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:40:00,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:40:00,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:40:00,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:40:00,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:40:00,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:40:00,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:40:00,508 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 19:40:00,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:40:00,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:40:00,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:40:00,771 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:40:00,771 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:40:00,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i [2025-04-13 19:40:02,064 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa688cd56/cd216927299e437b9cb4e84dd014cfef/FLAGd346b45c0 [2025-04-13 19:40:02,336 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:40:02,336 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i [2025-04-13 19:40:02,351 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa688cd56/cd216927299e437b9cb4e84dd014cfef/FLAGd346b45c0 [2025-04-13 19:40:03,065 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa688cd56/cd216927299e437b9cb4e84dd014cfef [2025-04-13 19:40:03,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:40:03,068 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:40:03,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:40:03,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:40:03,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:40:03,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c8171f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03, skipping insertion in model container [2025-04-13 19:40:03,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:40:03,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i[1105,1118] [2025-04-13 19:40:03,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:40:03,440 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:40:03,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i[1105,1118] [2025-04-13 19:40:03,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:40:03,534 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:40:03,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03 WrapperNode [2025-04-13 19:40:03,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:40:03,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:40:03,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:40:03,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:40:03,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,576 INFO L138 Inliner]: procedures = 162, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2025-04-13 19:40:03,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:40:03,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:40:03,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:40:03,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:40:03,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,597 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-04-13 19:40:03,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:40:03,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:40:03,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:40:03,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:40:03,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (1/1) ... [2025-04-13 19:40:03,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:03,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:40:03,633 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 19:40:03,637 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 19:40:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:40:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:40:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 19:40:03,650 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 19:40:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:40:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:40:03,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:40:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 19:40:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:40:03,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:40:03,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:40:03,651 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 19:40:03,749 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:40:03,750 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:40:03,949 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:40:03,949 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:40:03,949 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:40:04,121 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:40:04,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:40:04 BoogieIcfgContainer [2025-04-13 19:40:04,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:40:04,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:40:04,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:40:04,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:40:04,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:40:03" (1/3) ... [2025-04-13 19:40:04,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a045fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:40:04, skipping insertion in model container [2025-04-13 19:40:04,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:03" (2/3) ... [2025-04-13 19:40:04,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a045fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:40:04, skipping insertion in model container [2025-04-13 19:40:04,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:40:04" (3/3) ... [2025-04-13 19:40:04,131 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i [2025-04-13 19:40:04,141 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:40:04,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_32-traces-mine-vs-oplus-vs-meet_true.i that has 2 procedures, 42 locations, 40 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 19:40:04,143 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:40:04,181 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 19:40:04,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 89 flow [2025-04-13 19:40:04,231 INFO L116 PetriNetUnfolderBase]: 0/40 cut-off events. [2025-04-13 19:40:04,233 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:40:04,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 40 events. 0/40 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 19:40:04,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 41 transitions, 89 flow [2025-04-13 19:40:04,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 33 transitions, 69 flow [2025-04-13 19:40:04,248 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:40:04,260 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;@470f60ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:40:04,260 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:40:04,269 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:40:04,269 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-13 19:40:04,269 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:40:04,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:04,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:04,270 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:04,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash -668790403, now seen corresponding path program 1 times [2025-04-13 19:40:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:04,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475364085] [2025-04-13 19:40:04,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:04,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:04,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:40:04,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:40:04,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:04,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:04,562 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 19:40:04,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:04,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475364085] [2025-04-13 19:40:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475364085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:04,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:04,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:40:04,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581895253] [2025-04-13 19:40:04,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:04,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:40:04,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:04,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:40:04,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:40:04,592 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-13 19:40:04,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 19:40:04,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:04,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-13 19:40:04,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:04,739 INFO L116 PetriNetUnfolderBase]: 104/303 cut-off events. [2025-04-13 19:40:04,739 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:40:04,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 303 events. 104/303 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1379 event pairs, 68 based on Foata normal form. 12/310 useless extension candidates. Maximal degree in co-relation 543. Up to 186 conditions per place. [2025-04-13 19:40:04,744 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 27 selfloop transitions, 3 changer transitions 4/44 dead transitions. [2025-04-13 19:40:04,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 44 transitions, 159 flow [2025-04-13 19:40:04,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:40:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:40:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-04-13 19:40:04,752 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-04-13 19:40:04,754 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 69 flow. Second operand 3 states and 75 transitions. [2025-04-13 19:40:04,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 44 transitions, 159 flow [2025-04-13 19:40:04,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:40:04,760 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 86 flow [2025-04-13 19:40:04,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-04-13 19:40:04,764 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2025-04-13 19:40:04,764 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 86 flow [2025-04-13 19:40:04,764 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 19:40:04,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:04,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:04,765 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:40:04,765 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:04,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:04,765 INFO L85 PathProgramCache]: Analyzing trace with hash 497888756, now seen corresponding path program 1 times [2025-04-13 19:40:04,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:04,765 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379596916] [2025-04-13 19:40:04,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:04,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:04,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:40:04,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:40:04,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:04,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:04,851 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 19:40:04,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:04,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379596916] [2025-04-13 19:40:04,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379596916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:04,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:04,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:40:04,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631952746] [2025-04-13 19:40:04,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:04,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:40:04,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:04,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:40:04,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:40:04,853 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-13 19:40:04,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 19:40:04,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:04,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-13 19:40:04,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:04,975 INFO L116 PetriNetUnfolderBase]: 74/254 cut-off events. [2025-04-13 19:40:04,975 INFO L117 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-04-13 19:40:04,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 254 events. 74/254 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1107 event pairs, 31 based on Foata normal form. 17/266 useless extension candidates. Maximal degree in co-relation 501. Up to 119 conditions per place. [2025-04-13 19:40:04,977 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 23 selfloop transitions, 8 changer transitions 8/49 dead transitions. [2025-04-13 19:40:04,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 208 flow [2025-04-13 19:40:04,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:40:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:40:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-04-13 19:40:04,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-13 19:40:04,979 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 86 flow. Second operand 3 states and 82 transitions. [2025-04-13 19:40:04,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 208 flow [2025-04-13 19:40:04,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:04,980 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 116 flow [2025-04-13 19:40:04,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2025-04-13 19:40:04,981 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2025-04-13 19:40:04,981 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 116 flow [2025-04-13 19:40:04,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 19:40:04,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:04,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:04,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:40:04,981 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:04,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash 223627513, now seen corresponding path program 1 times [2025-04-13 19:40:04,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:04,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274028834] [2025-04-13 19:40:04,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:05,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:40:05,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:40:05,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:05,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:05,193 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 19:40:05,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:05,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274028834] [2025-04-13 19:40:05,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274028834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:05,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:05,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:40:05,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102467146] [2025-04-13 19:40:05,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:05,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:40:05,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:05,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:40:05,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:40:05,194 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-13 19:40:05,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 19:40:05,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:05,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-13 19:40:05,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:05,279 INFO L116 PetriNetUnfolderBase]: 54/218 cut-off events. [2025-04-13 19:40:05,279 INFO L117 PetriNetUnfolderBase]: For 105/107 co-relation queries the response was YES. [2025-04-13 19:40:05,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 218 events. 54/218 cut-off events. For 105/107 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 882 event pairs, 29 based on Foata normal form. 5/221 useless extension candidates. Maximal degree in co-relation 509. Up to 105 conditions per place. [2025-04-13 19:40:05,281 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 22 selfloop transitions, 5 changer transitions 4/41 dead transitions. [2025-04-13 19:40:05,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 196 flow [2025-04-13 19:40:05,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-13 19:40:05,283 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5060975609756098 [2025-04-13 19:40:05,283 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 116 flow. Second operand 4 states and 83 transitions. [2025-04-13 19:40:05,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 196 flow [2025-04-13 19:40:05,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 181 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:05,285 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 109 flow [2025-04-13 19:40:05,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2025-04-13 19:40:05,285 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2025-04-13 19:40:05,285 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 109 flow [2025-04-13 19:40:05,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 19:40:05,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:05,287 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] [2025-04-13 19:40:05,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:40:05,287 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:05,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1492966425, now seen corresponding path program 1 times [2025-04-13 19:40:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:05,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183459609] [2025-04-13 19:40:05,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:05,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:40:05,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:40:05,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:05,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:05,434 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 19:40:05,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:05,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183459609] [2025-04-13 19:40:05,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183459609] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:05,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:05,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:40:05,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732739373] [2025-04-13 19:40:05,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:05,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:40:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:05,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:40:05,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:40:05,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-13 19:40:05,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 19:40:05,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:05,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-13 19:40:05,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:05,500 INFO L116 PetriNetUnfolderBase]: 41/159 cut-off events. [2025-04-13 19:40:05,500 INFO L117 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-04-13 19:40:05,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 159 events. 41/159 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 555 event pairs, 18 based on Foata normal form. 1/155 useless extension candidates. Maximal degree in co-relation 360. Up to 69 conditions per place. [2025-04-13 19:40:05,502 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 13 selfloop transitions, 6 changer transitions 12/39 dead transitions. [2025-04-13 19:40:05,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 179 flow [2025-04-13 19:40:05,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-13 19:40:05,503 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:40:05,503 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 109 flow. Second operand 4 states and 82 transitions. [2025-04-13 19:40:05,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 179 flow [2025-04-13 19:40:05,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:40:05,505 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 77 flow [2025-04-13 19:40:05,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=77, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2025-04-13 19:40:05,506 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2025-04-13 19:40:05,506 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 77 flow [2025-04-13 19:40:05,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 19:40:05,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:05,506 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] [2025-04-13 19:40:05,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:40:05,506 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:05,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1907288834, now seen corresponding path program 1 times [2025-04-13 19:40:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:05,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640500694] [2025-04-13 19:40:05,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:05,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:40:05,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:40:05,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:05,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:05,679 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 19:40:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:05,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640500694] [2025-04-13 19:40:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640500694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:05,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:40:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325039955] [2025-04-13 19:40:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:05,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:40:05,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:05,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:40:05,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:40:05,681 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-04-13 19:40:05,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 19:40:05,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:05,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-04-13 19:40:05,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:05,722 INFO L116 PetriNetUnfolderBase]: 12/65 cut-off events. [2025-04-13 19:40:05,722 INFO L117 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-04-13 19:40:05,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 65 events. 12/65 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 170 event pairs, 0 based on Foata normal form. 7/72 useless extension candidates. Maximal degree in co-relation 132. Up to 36 conditions per place. [2025-04-13 19:40:05,722 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2025-04-13 19:40:05,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 137 flow [2025-04-13 19:40:05,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-13 19:40:05,723 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2025-04-13 19:40:05,723 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 77 flow. Second operand 4 states and 75 transitions. [2025-04-13 19:40:05,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 137 flow [2025-04-13 19:40:05,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 116 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:40:05,724 INFO L231 Difference]: Finished difference. Result has 31 places, 0 transitions, 0 flow [2025-04-13 19:40:05,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=31, PETRI_TRANSITIONS=0} [2025-04-13 19:40:05,724 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2025-04-13 19:40:05,724 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 0 transitions, 0 flow [2025-04-13 19:40:05,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 19:40:05,726 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 19:40:05,727 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 19:40:05,727 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 19:40:05,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:40:05,728 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-13 19:40:05,730 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:40:05,730 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:40:05,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:40:05 BasicIcfg [2025-04-13 19:40:05,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:40:05,736 INFO L158 Benchmark]: Toolchain (without parser) took 2667.89ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 96.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2025-04-13 19:40:05,736 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:05,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.70ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 84.1MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:40:05,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.00ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 82.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:05,738 INFO L158 Benchmark]: Boogie Preprocessor took 29.03ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:40:05,738 INFO L158 Benchmark]: RCFGBuilder took 516.73ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 39.7MB in the end (delta: 41.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 19:40:05,738 INFO L158 Benchmark]: TraceAbstraction took 1610.99ms. Allocated memory is still 155.2MB. Free memory was 39.7MB in the beginning and 96.3MB in the end (delta: -56.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:05,739 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.14ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 466.70ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 84.1MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.00ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 82.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.03ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.8MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 516.73ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 39.7MB in the end (delta: 41.1MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1610.99ms. Allocated memory is still 155.2MB. Free memory was 39.7MB in the beginning and 96.3MB in the end (delta: -56.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 3 procedures, 61 locations, 60 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.5s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 0 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 457 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:40:05,752 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...