/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_34-traces-minepp-L-needs-to-be-um_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:40:04,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:40:04,252 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:04,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:40:04,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:40:04,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:40:04,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:40:04,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:40:04,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:40:04,277 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:40:04,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:40:04,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:40:04,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:40:04,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:40:04,277 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:40:04,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:40:04,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:40:04,277 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:40:04,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:04,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:40:04,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:40:04,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:40:04,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:40:04,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:04,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:40:04,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:40:04,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:40:04,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:40:04,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:40:04,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:40:04,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:40:04,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:40:04,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:40:04,279 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:04,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:40:04,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:40:04,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:40:04,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:40:04,481 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:40:04,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_34-traces-minepp-L-needs-to-be-um_true.i [2025-04-13 19:40:05,762 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffc91c2e/35b9310afe3e4accace3f12ba84e5f18/FLAG70cdd208e [2025-04-13 19:40:05,989 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:40:05,989 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_34-traces-minepp-L-needs-to-be-um_true.i [2025-04-13 19:40:05,998 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffc91c2e/35b9310afe3e4accace3f12ba84e5f18/FLAG70cdd208e [2025-04-13 19:40:06,812 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffc91c2e/35b9310afe3e4accace3f12ba84e5f18 [2025-04-13 19:40:06,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:40:06,815 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:40:06,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:40:06,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:40:06,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:40:06,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:40:06" (1/1) ... [2025-04-13 19:40:06,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da73a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:06, skipping insertion in model container [2025-04-13 19:40:06,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:40:06" (1/1) ... [2025-04-13 19:40:06,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:40:07,003 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_34-traces-minepp-L-needs-to-be-um_true.i[1107,1120] [2025-04-13 19:40:07,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:40:07,157 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:40:07,177 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_34-traces-minepp-L-needs-to-be-um_true.i[1107,1120] [2025-04-13 19:40:07,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:40:07,218 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:40:07,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:07 WrapperNode [2025-04-13 19:40:07,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:40:07,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:40:07,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:40:07,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:40:07,224 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:07" (1/1) ... [2025-04-13 19:40:07,237 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:07" (1/1) ... [2025-04-13 19:40:07,256 INFO L138 Inliner]: procedures = 163, calls = 40, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2025-04-13 19:40:07,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:40:07,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:40:07,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:40:07,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:40:07,262 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:07" (1/1) ... [2025-04-13 19:40:07,263 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:07" (1/1) ... [2025-04-13 19:40:07,266 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:07" (1/1) ... [2025-04-13 19:40:07,282 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:07,282 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:07" (1/1) ... [2025-04-13 19:40:07,282 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:07" (1/1) ... [2025-04-13 19:40:07,285 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:07" (1/1) ... [2025-04-13 19:40:07,286 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:07" (1/1) ... [2025-04-13 19:40:07,287 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:07" (1/1) ... [2025-04-13 19:40:07,288 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:07" (1/1) ... [2025-04-13 19:40:07,288 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:07" (1/1) ... [2025-04-13 19:40:07,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:40:07,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:40:07,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:40:07,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:40:07,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:07" (1/1) ... [2025-04-13 19:40:07,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:40:07,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:40:07,320 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:07,322 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:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:40:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:40:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 19:40:07,337 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 19:40:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:40:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:40:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:40:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 19:40:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:40:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:40:07,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:40:07,338 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:07,432 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:40:07,433 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:40:07,577 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:40:07,580 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:40:07,580 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:40:07,712 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:40:07,715 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:40:07,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:40:07 BoogieIcfgContainer [2025-04-13 19:40:07,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:40:07,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:40:07,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:40:07,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:40:07,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:40:06" (1/3) ... [2025-04-13 19:40:07,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54be78e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:40:07, skipping insertion in model container [2025-04-13 19:40:07,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:40:07" (2/3) ... [2025-04-13 19:40:07,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54be78e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:40:07, skipping insertion in model container [2025-04-13 19:40:07,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:40:07" (3/3) ... [2025-04-13 19:40:07,722 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_34-traces-minepp-L-needs-to-be-um_true.i [2025-04-13 19:40:07,733 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:40:07,735 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_34-traces-minepp-L-needs-to-be-um_true.i that has 2 procedures, 35 locations, 35 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:40:07,735 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:40:07,767 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:40:07,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 76 flow [2025-04-13 19:40:07,807 INFO L116 PetriNetUnfolderBase]: 2/35 cut-off events. [2025-04-13 19:40:07,809 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:40:07,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-13 19:40:07,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 76 flow [2025-04-13 19:40:07,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 33 transitions, 69 flow [2025-04-13 19:40:07,818 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:40:07,827 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;@39f42fb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:40:07,827 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-13 19:40:07,838 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:40:07,838 INFO L116 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-04-13 19:40:07,838 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:40:07,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:07,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:07,839 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:07,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash 607305871, now seen corresponding path program 1 times [2025-04-13 19:40:07,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:07,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793832930] [2025-04-13 19:40:07,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:07,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:40:07,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:40:07,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:08,088 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:08,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:08,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793832930] [2025-04-13 19:40:08,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793832930] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:08,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:08,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:40:08,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270515826] [2025-04-13 19:40:08,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:08,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:40:08,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:08,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:40:08,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:40:08,114 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-04-13 19:40:08,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:08,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:08,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-04-13 19:40:08,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:08,220 INFO L116 PetriNetUnfolderBase]: 93/258 cut-off events. [2025-04-13 19:40:08,220 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:40:08,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 258 events. 93/258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1157 event pairs, 66 based on Foata normal form. 18/258 useless extension candidates. Maximal degree in co-relation 464. Up to 151 conditions per place. [2025-04-13 19:40:08,224 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 28 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-04-13 19:40:08,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 147 flow [2025-04-13 19:40:08,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:40:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:40:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-13 19:40:08,232 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-04-13 19:40:08,233 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 69 flow. Second operand 3 states and 66 transitions. [2025-04-13 19:40:08,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 147 flow [2025-04-13 19:40:08,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:40:08,240 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 81 flow [2025-04-13 19:40:08,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=81, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-04-13 19:40:08,245 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2025-04-13 19:40:08,245 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 81 flow [2025-04-13 19:40:08,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:08,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:08,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:08,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:40:08,246 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:08,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:08,247 INFO L85 PathProgramCache]: Analyzing trace with hash -422190502, now seen corresponding path program 1 times [2025-04-13 19:40:08,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:08,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123745538] [2025-04-13 19:40:08,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:08,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:08,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:40:08,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:40:08,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:08,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:08,445 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:08,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:08,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123745538] [2025-04-13 19:40:08,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123745538] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:08,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:08,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:40:08,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630310974] [2025-04-13 19:40:08,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:08,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:40:08,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:08,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:40:08,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:40:08,447 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-04-13 19:40:08,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:08,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:08,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-04-13 19:40:08,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:08,570 INFO L116 PetriNetUnfolderBase]: 75/239 cut-off events. [2025-04-13 19:40:08,570 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-13 19:40:08,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 239 events. 75/239 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1041 event pairs, 26 based on Foata normal form. 9/230 useless extension candidates. Maximal degree in co-relation 464. Up to 101 conditions per place. [2025-04-13 19:40:08,575 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 30 selfloop transitions, 6 changer transitions 5/51 dead transitions. [2025-04-13 19:40:08,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 207 flow [2025-04-13 19:40:08,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-13 19:40:08,580 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-04-13 19:40:08,581 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 81 flow. Second operand 4 states and 87 transitions. [2025-04-13 19:40:08,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 207 flow [2025-04-13 19:40:08,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 197 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:08,582 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 102 flow [2025-04-13 19:40:08,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-04-13 19:40:08,583 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2025-04-13 19:40:08,583 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 102 flow [2025-04-13 19:40:08,583 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:08,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:08,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:08,583 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:40:08,583 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:08,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash -866122534, now seen corresponding path program 2 times [2025-04-13 19:40:08,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:08,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081154374] [2025-04-13 19:40:08,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:40:08,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:08,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:40:08,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:40:08,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:40:08,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:08,684 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:08,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:08,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081154374] [2025-04-13 19:40:08,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081154374] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:08,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:08,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:40:08,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157673520] [2025-04-13 19:40:08,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:08,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:40:08,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:08,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:40:08,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:40:08,685 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-04-13 19:40:08,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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 19:40:08,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:08,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-04-13 19:40:08,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:08,769 INFO L116 PetriNetUnfolderBase]: 57/205 cut-off events. [2025-04-13 19:40:08,769 INFO L117 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-04-13 19:40:08,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 205 events. 57/205 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 858 event pairs, 31 based on Foata normal form. 7/188 useless extension candidates. Maximal degree in co-relation 438. Up to 95 conditions per place. [2025-04-13 19:40:08,770 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 17 selfloop transitions, 8 changer transitions 11/44 dead transitions. [2025-04-13 19:40:08,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 198 flow [2025-04-13 19:40:08,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-13 19:40:08,771 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2025-04-13 19:40:08,771 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 102 flow. Second operand 4 states and 79 transitions. [2025-04-13 19:40:08,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 198 flow [2025-04-13 19:40:08,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:40:08,772 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 104 flow [2025-04-13 19:40:08,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2025-04-13 19:40:08,773 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-04-13 19:40:08,773 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 104 flow [2025-04-13 19:40:08,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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 19:40:08,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:08,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:08,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:40:08,773 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:08,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1124547141, now seen corresponding path program 1 times [2025-04-13 19:40:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:08,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286255044] [2025-04-13 19:40:08,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:08,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:08,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:40:08,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:40:08,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:08,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:08,841 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:08,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:08,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286255044] [2025-04-13 19:40:08,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286255044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:08,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:08,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:40:08,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339886720] [2025-04-13 19:40:08,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:08,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:40:08,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:08,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:40:08,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:40:08,842 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-04-13 19:40:08,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:08,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:08,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-04-13 19:40:08,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:08,898 INFO L116 PetriNetUnfolderBase]: 33/145 cut-off events. [2025-04-13 19:40:08,898 INFO L117 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-04-13 19:40:08,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 145 events. 33/145 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 524 event pairs, 13 based on Foata normal form. 6/149 useless extension candidates. Maximal degree in co-relation 365. Up to 74 conditions per place. [2025-04-13 19:40:08,899 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 17 selfloop transitions, 5 changer transitions 9/39 dead transitions. [2025-04-13 19:40:08,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 218 flow [2025-04-13 19:40:08,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:40:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:40:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-04-13 19:40:08,901 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-13 19:40:08,901 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 104 flow. Second operand 3 states and 63 transitions. [2025-04-13 19:40:08,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 218 flow [2025-04-13 19:40:08,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 199 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:40:08,902 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 113 flow [2025-04-13 19:40:08,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-04-13 19:40:08,903 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-04-13 19:40:08,903 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 113 flow [2025-04-13 19:40:08,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:08,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:08,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:08,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:40:08,903 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:08,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:08,904 INFO L85 PathProgramCache]: Analyzing trace with hash -305520859, now seen corresponding path program 2 times [2025-04-13 19:40:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:08,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068922733] [2025-04-13 19:40:08,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:40:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:08,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:40:08,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:40:08,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:40:08,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:09,033 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:09,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:09,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068922733] [2025-04-13 19:40:09,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068922733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:09,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:09,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:40:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731662278] [2025-04-13 19:40:09,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:09,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:40:09,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:09,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:40:09,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:40:09,035 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-04-13 19:40:09,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 113 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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 19:40:09,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:09,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-04-13 19:40:09,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:09,089 INFO L116 PetriNetUnfolderBase]: 18/85 cut-off events. [2025-04-13 19:40:09,089 INFO L117 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-04-13 19:40:09,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 85 events. 18/85 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 8 based on Foata normal form. 3/82 useless extension candidates. Maximal degree in co-relation 222. Up to 35 conditions per place. [2025-04-13 19:40:09,091 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 9 selfloop transitions, 4 changer transitions 15/34 dead transitions. [2025-04-13 19:40:09,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 191 flow [2025-04-13 19:40:09,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-13 19:40:09,092 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2025-04-13 19:40:09,092 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 113 flow. Second operand 4 states and 71 transitions. [2025-04-13 19:40:09,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 191 flow [2025-04-13 19:40:09,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 177 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:40:09,093 INFO L231 Difference]: Finished difference. Result has 38 places, 18 transitions, 67 flow [2025-04-13 19:40:09,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=38, PETRI_TRANSITIONS=18} [2025-04-13 19:40:09,094 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2025-04-13 19:40:09,094 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 18 transitions, 67 flow [2025-04-13 19:40:09,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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 19:40:09,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:40:09,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:40:09,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:40:09,094 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:40:09,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:40:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1801303026, now seen corresponding path program 1 times [2025-04-13 19:40:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:40:09,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971145604] [2025-04-13 19:40:09,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:40:09,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:40:09,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:40:09,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:40:09,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:40:09,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:40:09,239 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:09,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:40:09,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971145604] [2025-04-13 19:40:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971145604] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:40:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:40:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:40:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322405774] [2025-04-13 19:40:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:40:09,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:40:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:40:09,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:40:09,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:40:09,240 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2025-04-13 19:40:09,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 18 transitions, 67 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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:09,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:40:09,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2025-04-13 19:40:09,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:40:09,267 INFO L116 PetriNetUnfolderBase]: 5/29 cut-off events. [2025-04-13 19:40:09,267 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-13 19:40:09,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 29 events. 5/29 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 60. Up to 17 conditions per place. [2025-04-13 19:40:09,267 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2025-04-13 19:40:09,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 17 transitions, 80 flow [2025-04-13 19:40:09,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:40:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:40:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-13 19:40:09,269 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-04-13 19:40:09,269 INFO L175 Difference]: Start difference. First operand has 38 places, 18 transitions, 67 flow. Second operand 4 states and 56 transitions. [2025-04-13 19:40:09,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 17 transitions, 80 flow [2025-04-13 19:40:09,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 17 transitions, 62 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-13 19:40:09,270 INFO L231 Difference]: Finished difference. Result has 24 places, 0 transitions, 0 flow [2025-04-13 19:40:09,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=24, PETRI_TRANSITIONS=0} [2025-04-13 19:40:09,270 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -12 predicate places. [2025-04-13 19:40:09,270 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 0 transitions, 0 flow [2025-04-13 19:40:09,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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:09,272 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-13 19:40:09,274 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-13 19:40:09,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:40:09,274 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-04-13 19:40:09,276 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:40:09,276 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:40:09,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:40:09 BasicIcfg [2025-04-13 19:40:09,282 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:40:09,282 INFO L158 Benchmark]: Toolchain (without parser) took 2467.37ms. Allocated memory is still 125.8MB. Free memory was 86.1MB in the beginning and 65.3MB in the end (delta: 20.9MB). Peak memory consumption was 19.7MB. Max. memory is 8.0GB. [2025-04-13 19:40:09,282 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:09,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.11ms. Allocated memory is still 125.8MB. Free memory was 85.4MB in the beginning and 62.5MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:40:09,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.17ms. Allocated memory is still 125.8MB. Free memory was 62.5MB in the beginning and 61.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:09,283 INFO L158 Benchmark]: Boogie Preprocessor took 33.34ms. Allocated memory is still 125.8MB. Free memory was 61.0MB in the beginning and 59.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:40:09,283 INFO L158 Benchmark]: RCFGBuilder took 423.80ms. Allocated memory is still 125.8MB. Free memory was 59.0MB in the beginning and 83.9MB in the end (delta: -24.8MB). Peak memory consumption was 47.9MB. Max. memory is 8.0GB. [2025-04-13 19:40:09,284 INFO L158 Benchmark]: TraceAbstraction took 1565.42ms. Allocated memory is still 125.8MB. Free memory was 83.2MB in the beginning and 65.3MB in the end (delta: 17.9MB). Peak memory consumption was 17.9MB. Max. memory is 8.0GB. [2025-04-13 19:40:09,284 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.17ms. Allocated memory is still 159.4MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 403.11ms. Allocated memory is still 125.8MB. Free memory was 85.4MB in the beginning and 62.5MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.17ms. Allocated memory is still 125.8MB. Free memory was 62.5MB in the beginning and 61.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.34ms. Allocated memory is still 125.8MB. Free memory was 61.0MB in the beginning and 59.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 423.80ms. Allocated memory is still 125.8MB. Free memory was 59.0MB in the beginning and 83.9MB in the end (delta: -24.8MB). Peak memory consumption was 47.9MB. Max. memory is 8.0GB. * TraceAbstraction took 1565.42ms. Allocated memory is still 125.8MB. Free memory was 83.2MB in the beginning and 65.3MB in the end (delta: 17.9MB). Peak memory consumption was 17.9MB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 54 locations, 54 edges, 2 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: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 248 IncrementalHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 0 mSDtfsCounter, 248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=4, InterpolantAutomatonStates: 22, 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, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 19:40:09,299 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...