/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/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:38:04,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:38:04,846 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:38:04,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:38:04,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:38:04,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:38:04,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:38:04,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:38:04,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:38:04,878 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:38:04,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:38:04,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:38:04,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:38:04,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:38:04,879 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:38:04,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:38:04,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:38:04,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:38:04,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:38:04,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:38:04,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:38:04,881 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:38:05,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:38:05,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:38:05,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:38:05,122 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:38:05,123 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:38:05,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2025-04-13 19:38:06,421 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbdfaf700/14b9116186cc4c4f8f3008dede709f99/FLAG621426644 [2025-04-13 19:38:06,686 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:38:06,686 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2025-04-13 19:38:06,713 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbdfaf700/14b9116186cc4c4f8f3008dede709f99/FLAG621426644 [2025-04-13 19:38:07,422 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbdfaf700/14b9116186cc4c4f8f3008dede709f99 [2025-04-13 19:38:07,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:38:07,425 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:38:07,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:38:07,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:38:07,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:38:07,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180fb041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07, skipping insertion in model container [2025-04-13 19:38:07,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:38:07,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i[186210,186223] [2025-04-13 19:38:07,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:38:07,742 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:38:07,790 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i[186210,186223] [2025-04-13 19:38:07,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:38:07,846 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:38:07,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07 WrapperNode [2025-04-13 19:38:07,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:38:07,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:38:07,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:38:07,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:38:07,852 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:38:07" (1/1) ... [2025-04-13 19:38:07,867 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:38:07" (1/1) ... [2025-04-13 19:38:07,893 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2025-04-13 19:38:07,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:38:07,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:38:07,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:38:07,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:38:07,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,926 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 2, 13]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2025-04-13 19:38:07,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:38:07,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:38:07,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:38:07,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:38:07,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (1/1) ... [2025-04-13 19:38:07,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:38:07,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:38:07,987 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:38:07,993 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:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-04-13 19:38:08,009 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-13 19:38:08,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-13 19:38:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-13 19:38:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:38:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:38:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:38:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:38:08,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:38:08,011 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:38:08,225 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:38:08,227 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:38:08,381 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:38:08,382 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:38:08,382 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:38:08,590 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:38:08,613 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:38:08,644 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:38:08,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:38:08 BoogieIcfgContainer [2025-04-13 19:38:08,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:38:08,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:38:08,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:38:08,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:38:08,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:38:07" (1/3) ... [2025-04-13 19:38:08,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165a5852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:38:08, skipping insertion in model container [2025-04-13 19:38:08,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:38:07" (2/3) ... [2025-04-13 19:38:08,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165a5852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:38:08, skipping insertion in model container [2025-04-13 19:38:08,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:38:08" (3/3) ... [2025-04-13 19:38:08,652 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2025-04-13 19:38:08,662 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:38:08,664 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_1-container_of-global.i that has 2 procedures, 22 locations, 27 edges, 1 initial locations, 0 loop locations, and 6 error locations. [2025-04-13 19:38:08,664 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:38:08,717 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:38:08,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 34 transitions, 82 flow [2025-04-13 19:38:08,778 INFO L116 PetriNetUnfolderBase]: 3/32 cut-off events. [2025-04-13 19:38:08,779 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:38:08,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 3/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 54 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2025-04-13 19:38:08,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 34 transitions, 82 flow [2025-04-13 19:38:08,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 68 flow [2025-04-13 19:38:08,794 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:38:08,801 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;@4ced42cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:38:08,802 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 19:38:08,803 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:38:08,803 INFO L116 PetriNetUnfolderBase]: 0/0 cut-off events. [2025-04-13 19:38:08,803 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:38:08,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:08,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1] [2025-04-13 19:38:08,804 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:08,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash 461, now seen corresponding path program 1 times [2025-04-13 19:38:08,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:08,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749625586] [2025-04-13 19:38:08,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:08,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 19:38:08,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 19:38:08,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:08,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:09,241 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:38:09,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:09,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749625586] [2025-04-13 19:38:09,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749625586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:09,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:09,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 19:38:09,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375213193] [2025-04-13 19:38:09,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:09,249 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:38:09,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:09,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:38:09,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:38:09,270 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:09,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 68 flow. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:38:09,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:09,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:09,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:09,382 INFO L116 PetriNetUnfolderBase]: 105/205 cut-off events. [2025-04-13 19:38:09,382 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-13 19:38:09,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 205 events. 105/205 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 598 event pairs, 105 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 368. Up to 206 conditions per place. [2025-04-13 19:38:09,385 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 20 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2025-04-13 19:38:09,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 92 flow [2025-04-13 19:38:09,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:38:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:38:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-04-13 19:38:09,397 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-04-13 19:38:09,398 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 68 flow. Second operand 2 states and 32 transitions. [2025-04-13 19:38:09,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 92 flow [2025-04-13 19:38:09,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 84 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:38:09,403 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 44 flow [2025-04-13 19:38:09,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2025-04-13 19:38:09,409 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -7 predicate places. [2025-04-13 19:38:09,409 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 44 flow [2025-04-13 19:38:09,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:38:09,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:09,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:09,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:38:09,410 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:09,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1987856931, now seen corresponding path program 1 times [2025-04-13 19:38:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:09,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849831809] [2025-04-13 19:38:09,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:09,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:09,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:09,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:09,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:10,040 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:38:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:10,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849831809] [2025-04-13 19:38:10,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849831809] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:10,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:10,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:38:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156777592] [2025-04-13 19:38:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:10,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:38:10,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:10,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:38:10,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:38:10,042 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:10,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 44 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:38:10,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:10,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:10,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:10,214 INFO L116 PetriNetUnfolderBase]: 125/250 cut-off events. [2025-04-13 19:38:10,214 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-13 19:38:10,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 250 events. 125/250 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 844 event pairs, 15 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 507. Up to 115 conditions per place. [2025-04-13 19:38:10,218 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 35 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2025-04-13 19:38:10,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 40 transitions, 167 flow [2025-04-13 19:38:10,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:38:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:38:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-04-13 19:38:10,220 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3 [2025-04-13 19:38:10,220 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 44 flow. Second operand 5 states and 51 transitions. [2025-04-13 19:38:10,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 40 transitions, 167 flow [2025-04-13 19:38:10,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 40 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:38:10,223 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 71 flow [2025-04-13 19:38:10,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2025-04-13 19:38:10,224 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-04-13 19:38:10,224 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 71 flow [2025-04-13 19:38:10,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:38:10,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:10,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:10,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:38:10,224 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:10,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash 423753814, now seen corresponding path program 1 times [2025-04-13 19:38:10,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:10,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826044010] [2025-04-13 19:38:10,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:10,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:10,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:10,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:10,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:10,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:10,652 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:38:10,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:10,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826044010] [2025-04-13 19:38:10,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826044010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:10,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:10,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:38:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157487600] [2025-04-13 19:38:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:10,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:38:10,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:10,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:38:10,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:38:10,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:10,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:38:10,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:10,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:10,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:10,834 INFO L116 PetriNetUnfolderBase]: 135/272 cut-off events. [2025-04-13 19:38:10,834 INFO L117 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-04-13 19:38:10,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 272 events. 135/272 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 995 event pairs, 17 based on Foata normal form. 4/276 useless extension candidates. Maximal degree in co-relation 628. Up to 187 conditions per place. [2025-04-13 19:38:10,836 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 37 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2025-04-13 19:38:10,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 43 transitions, 221 flow [2025-04-13 19:38:10,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:38:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:38:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-04-13 19:38:10,838 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3058823529411765 [2025-04-13 19:38:10,838 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 71 flow. Second operand 5 states and 52 transitions. [2025-04-13 19:38:10,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 43 transitions, 221 flow [2025-04-13 19:38:10,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:38:10,839 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 104 flow [2025-04-13 19:38:10,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-04-13 19:38:10,840 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2025-04-13 19:38:10,840 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 104 flow [2025-04-13 19:38:10,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:38:10,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:10,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:10,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:38:10,840 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:10,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1150446416, now seen corresponding path program 2 times [2025-04-13 19:38:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:10,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550277279] [2025-04-13 19:38:10,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:38:10,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:10,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:10,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:10,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:10,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:11,522 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:38:11,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:11,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550277279] [2025-04-13 19:38:11,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550277279] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:11,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:11,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:38:11,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364504630] [2025-04-13 19:38:11,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:11,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:38:11,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:11,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:38:11,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:38:11,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:11,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 104 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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:38:11,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:11,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:11,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:11,761 INFO L116 PetriNetUnfolderBase]: 176/359 cut-off events. [2025-04-13 19:38:11,761 INFO L117 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-04-13 19:38:11,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 359 events. 176/359 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1398 event pairs, 38 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 992. Up to 184 conditions per place. [2025-04-13 19:38:11,765 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 51 selfloop transitions, 9 changer transitions 0/60 dead transitions. [2025-04-13 19:38:11,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 352 flow [2025-04-13 19:38:11,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:38:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:38:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2025-04-13 19:38:11,767 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27310924369747897 [2025-04-13 19:38:11,767 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 104 flow. Second operand 7 states and 65 transitions. [2025-04-13 19:38:11,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 352 flow [2025-04-13 19:38:11,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:38:11,769 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 176 flow [2025-04-13 19:38:11,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2025-04-13 19:38:11,770 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-04-13 19:38:11,770 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 176 flow [2025-04-13 19:38:11,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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:38:11,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:11,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:11,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:38:11,771 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:11,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1343703220, now seen corresponding path program 3 times [2025-04-13 19:38:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:11,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567284650] [2025-04-13 19:38:11,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:38:11,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:11,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:11,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:11,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:38:11,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:12,055 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:38:12,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:12,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567284650] [2025-04-13 19:38:12,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567284650] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:12,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:12,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:38:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760131762] [2025-04-13 19:38:12,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:12,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:38:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:12,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:38:12,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:38:12,057 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:12,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:38:12,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:12,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:12,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:12,229 INFO L116 PetriNetUnfolderBase]: 226/477 cut-off events. [2025-04-13 19:38:12,229 INFO L117 PetriNetUnfolderBase]: For 457/457 co-relation queries the response was YES. [2025-04-13 19:38:12,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 477 events. 226/477 cut-off events. For 457/457 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2198 event pairs, 51 based on Foata normal form. 8/485 useless extension candidates. Maximal degree in co-relation 1427. Up to 321 conditions per place. [2025-04-13 19:38:12,233 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 53 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2025-04-13 19:38:12,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 439 flow [2025-04-13 19:38:12,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:38:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:38:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-04-13 19:38:12,234 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3588235294117647 [2025-04-13 19:38:12,234 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 176 flow. Second operand 5 states and 61 transitions. [2025-04-13 19:38:12,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 439 flow [2025-04-13 19:38:12,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 414 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 19:38:12,237 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 243 flow [2025-04-13 19:38:12,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2025-04-13 19:38:12,240 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2025-04-13 19:38:12,240 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 243 flow [2025-04-13 19:38:12,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:38:12,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:12,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:12,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:38:12,240 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:12,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:12,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1385605050, now seen corresponding path program 4 times [2025-04-13 19:38:12,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:12,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793075843] [2025-04-13 19:38:12,241 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:38:12,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:12,257 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:12,278 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:12,279 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:38:12,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:12,599 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:38:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:12,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793075843] [2025-04-13 19:38:12,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793075843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:12,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:12,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:38:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516321050] [2025-04-13 19:38:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:12,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:38:12,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:12,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:38:12,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:38:12,601 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:12,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:38:12,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:12,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:12,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:12,762 INFO L116 PetriNetUnfolderBase]: 218/467 cut-off events. [2025-04-13 19:38:12,762 INFO L117 PetriNetUnfolderBase]: For 837/837 co-relation queries the response was YES. [2025-04-13 19:38:12,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 467 events. 218/467 cut-off events. For 837/837 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2137 event pairs, 53 based on Foata normal form. 6/473 useless extension candidates. Maximal degree in co-relation 1535. Up to 329 conditions per place. [2025-04-13 19:38:12,765 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 44 selfloop transitions, 15 changer transitions 0/59 dead transitions. [2025-04-13 19:38:12,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 477 flow [2025-04-13 19:38:12,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:38:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:38:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2025-04-13 19:38:12,767 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2647058823529412 [2025-04-13 19:38:12,767 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 243 flow. Second operand 6 states and 54 transitions. [2025-04-13 19:38:12,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 477 flow [2025-04-13 19:38:12,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 470 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:38:12,771 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 324 flow [2025-04-13 19:38:12,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-04-13 19:38:12,775 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2025-04-13 19:38:12,775 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 324 flow [2025-04-13 19:38:12,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:38:12,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:12,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:12,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:38:12,776 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:12,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash 563107952, now seen corresponding path program 5 times [2025-04-13 19:38:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:12,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79789017] [2025-04-13 19:38:12,776 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:38:12,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:12,796 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:12,813 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:12,814 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:12,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:13,285 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:38:13,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:13,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79789017] [2025-04-13 19:38:13,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79789017] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:13,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:13,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:38:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625073820] [2025-04-13 19:38:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:13,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:38:13,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:13,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:38:13,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:38:13,286 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:13,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 324 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:38:13,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:13,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:13,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:13,585 INFO L116 PetriNetUnfolderBase]: 217/466 cut-off events. [2025-04-13 19:38:13,585 INFO L117 PetriNetUnfolderBase]: For 1097/1097 co-relation queries the response was YES. [2025-04-13 19:38:13,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 466 events. 217/466 cut-off events. For 1097/1097 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2122 event pairs, 44 based on Foata normal form. 1/467 useless extension candidates. Maximal degree in co-relation 1684. Up to 269 conditions per place. [2025-04-13 19:38:13,589 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 61 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2025-04-13 19:38:13,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 634 flow [2025-04-13 19:38:13,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:38:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:38:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-04-13 19:38:13,592 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3025210084033613 [2025-04-13 19:38:13,592 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 324 flow. Second operand 7 states and 72 transitions. [2025-04-13 19:38:13,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 634 flow [2025-04-13 19:38:13,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 623 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 19:38:13,598 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 379 flow [2025-04-13 19:38:13,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2025-04-13 19:38:13,599 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 29 predicate places. [2025-04-13 19:38:13,599 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 379 flow [2025-04-13 19:38:13,599 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:38:13,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:13,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:13,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:38:13,599 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:13,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2093405314, now seen corresponding path program 6 times [2025-04-13 19:38:13,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:13,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119888936] [2025-04-13 19:38:13,601 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:38:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:13,629 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:13,637 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:13,637 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:38:13,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:13,838 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:38:13,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:13,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119888936] [2025-04-13 19:38:13,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119888936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:13,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:13,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:38:13,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872387762] [2025-04-13 19:38:13,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:13,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:38:13,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:13,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:38:13,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:38:13,840 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:13,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:38:13,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:13,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:13,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:13,996 INFO L116 PetriNetUnfolderBase]: 164/373 cut-off events. [2025-04-13 19:38:13,997 INFO L117 PetriNetUnfolderBase]: For 1063/1063 co-relation queries the response was YES. [2025-04-13 19:38:13,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1408 conditions, 373 events. 164/373 cut-off events. For 1063/1063 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1629 event pairs, 39 based on Foata normal form. 8/381 useless extension candidates. Maximal degree in co-relation 1389. Up to 150 conditions per place. [2025-04-13 19:38:13,999 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 53 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2025-04-13 19:38:13,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 593 flow [2025-04-13 19:38:13,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:38:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:38:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-04-13 19:38:14,000 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3588235294117647 [2025-04-13 19:38:14,000 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 379 flow. Second operand 5 states and 61 transitions. [2025-04-13 19:38:14,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 593 flow [2025-04-13 19:38:14,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 526 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-04-13 19:38:14,007 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 398 flow [2025-04-13 19:38:14,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=398, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2025-04-13 19:38:14,009 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2025-04-13 19:38:14,009 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 398 flow [2025-04-13 19:38:14,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:38:14,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:14,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:14,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:38:14,009 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:14,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash -964507216, now seen corresponding path program 7 times [2025-04-13 19:38:14,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:14,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318969795] [2025-04-13 19:38:14,010 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:38:14,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:14,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:14,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:14,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:14,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:14,466 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:38:14,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:14,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318969795] [2025-04-13 19:38:14,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318969795] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:14,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:14,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:38:14,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707779729] [2025-04-13 19:38:14,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:14,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:38:14,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:14,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:38:14,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:38:14,468 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:14,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 398 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:38:14,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:14,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:14,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:14,714 INFO L116 PetriNetUnfolderBase]: 163/372 cut-off events. [2025-04-13 19:38:14,714 INFO L117 PetriNetUnfolderBase]: For 1329/1329 co-relation queries the response was YES. [2025-04-13 19:38:14,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 372 events. 163/372 cut-off events. For 1329/1329 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1610 event pairs, 60 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 1342. Up to 247 conditions per place. [2025-04-13 19:38:14,717 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 59 selfloop transitions, 14 changer transitions 0/73 dead transitions. [2025-04-13 19:38:14,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 674 flow [2025-04-13 19:38:14,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:38:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:38:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-04-13 19:38:14,718 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3025210084033613 [2025-04-13 19:38:14,718 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 398 flow. Second operand 7 states and 72 transitions. [2025-04-13 19:38:14,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 674 flow [2025-04-13 19:38:14,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 622 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-04-13 19:38:14,724 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 396 flow [2025-04-13 19:38:14,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=396, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2025-04-13 19:38:14,724 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 34 predicate places. [2025-04-13 19:38:14,725 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 396 flow [2025-04-13 19:38:14,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:38:14,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:14,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:14,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:38:14,725 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:14,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:14,725 INFO L85 PathProgramCache]: Analyzing trace with hash -200930646, now seen corresponding path program 8 times [2025-04-13 19:38:14,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:14,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175962459] [2025-04-13 19:38:14,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:38:14,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:14,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:14,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:14,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:14,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:15,211 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:38:15,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:15,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175962459] [2025-04-13 19:38:15,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175962459] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:15,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:15,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:38:15,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058622235] [2025-04-13 19:38:15,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:15,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:38:15,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:15,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:38:15,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:38:15,212 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:15,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 396 flow. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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:38:15,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:15,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:15,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:15,393 INFO L116 PetriNetUnfolderBase]: 188/430 cut-off events. [2025-04-13 19:38:15,393 INFO L117 PetriNetUnfolderBase]: For 1059/1059 co-relation queries the response was YES. [2025-04-13 19:38:15,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 430 events. 188/430 cut-off events. For 1059/1059 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1989 event pairs, 40 based on Foata normal form. 1/431 useless extension candidates. Maximal degree in co-relation 1491. Up to 242 conditions per place. [2025-04-13 19:38:15,395 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 46 selfloop transitions, 11 changer transitions 20/77 dead transitions. [2025-04-13 19:38:15,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 77 transitions, 678 flow [2025-04-13 19:38:15,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:38:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:38:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2025-04-13 19:38:15,396 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28991596638655465 [2025-04-13 19:38:15,396 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 396 flow. Second operand 7 states and 69 transitions. [2025-04-13 19:38:15,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 77 transitions, 678 flow [2025-04-13 19:38:15,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 659 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:38:15,400 INFO L231 Difference]: Finished difference. Result has 69 places, 43 transitions, 358 flow [2025-04-13 19:38:15,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=358, PETRI_PLACES=69, PETRI_TRANSITIONS=43} [2025-04-13 19:38:15,400 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2025-04-13 19:38:15,400 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 43 transitions, 358 flow [2025-04-13 19:38:15,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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:38:15,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:15,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:15,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:38:15,401 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:15,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash 226980732, now seen corresponding path program 9 times [2025-04-13 19:38:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:15,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58918386] [2025-04-13 19:38:15,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:38:15,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:15,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:15,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:15,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:38:15,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:15,778 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:38:15,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:15,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58918386] [2025-04-13 19:38:15,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58918386] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:15,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:15,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:38:15,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542949040] [2025-04-13 19:38:15,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:15,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:38:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:15,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:38:15,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:38:15,780 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:15,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 43 transitions, 358 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:38:15,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:15,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:15,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:15,989 INFO L116 PetriNetUnfolderBase]: 146/340 cut-off events. [2025-04-13 19:38:15,989 INFO L117 PetriNetUnfolderBase]: For 865/865 co-relation queries the response was YES. [2025-04-13 19:38:15,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 340 events. 146/340 cut-off events. For 865/865 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1452 event pairs, 50 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 1194. Up to 210 conditions per place. [2025-04-13 19:38:15,991 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 37 selfloop transitions, 10 changer transitions 18/65 dead transitions. [2025-04-13 19:38:15,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 576 flow [2025-04-13 19:38:15,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:38:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:38:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2025-04-13 19:38:15,992 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2025-04-13 19:38:15,992 INFO L175 Difference]: Start difference. First operand has 69 places, 43 transitions, 358 flow. Second operand 7 states and 70 transitions. [2025-04-13 19:38:15,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 576 flow [2025-04-13 19:38:15,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 541 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-04-13 19:38:15,997 INFO L231 Difference]: Finished difference. Result has 67 places, 38 transitions, 298 flow [2025-04-13 19:38:15,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=298, PETRI_PLACES=67, PETRI_TRANSITIONS=38} [2025-04-13 19:38:15,997 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2025-04-13 19:38:15,997 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 38 transitions, 298 flow [2025-04-13 19:38:15,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:38:15,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:15,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:15,998 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:38:15,998 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:15,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1093078907, now seen corresponding path program 2 times [2025-04-13 19:38:15,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:15,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301367909] [2025-04-13 19:38:15,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:38:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:16,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:38:16,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:16,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:16,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:16,168 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:38:16,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:16,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301367909] [2025-04-13 19:38:16,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301367909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:16,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:16,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:38:16,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13222195] [2025-04-13 19:38:16,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:16,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:38:16,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:16,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:38:16,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:38:16,169 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:16,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 38 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:38:16,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:16,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:16,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:16,256 INFO L116 PetriNetUnfolderBase]: 112/262 cut-off events. [2025-04-13 19:38:16,256 INFO L117 PetriNetUnfolderBase]: For 666/666 co-relation queries the response was YES. [2025-04-13 19:38:16,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 262 events. 112/262 cut-off events. For 666/666 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1025 event pairs, 15 based on Foata normal form. 3/265 useless extension candidates. Maximal degree in co-relation 899. Up to 125 conditions per place. [2025-04-13 19:38:16,257 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 19 selfloop transitions, 5 changer transitions 24/48 dead transitions. [2025-04-13 19:38:16,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 48 transitions, 421 flow [2025-04-13 19:38:16,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:38:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:38:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2025-04-13 19:38:16,258 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27058823529411763 [2025-04-13 19:38:16,258 INFO L175 Difference]: Start difference. First operand has 67 places, 38 transitions, 298 flow. Second operand 5 states and 46 transitions. [2025-04-13 19:38:16,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 48 transitions, 421 flow [2025-04-13 19:38:16,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 372 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-04-13 19:38:16,260 INFO L231 Difference]: Finished difference. Result has 57 places, 19 transitions, 103 flow [2025-04-13 19:38:16,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=57, PETRI_TRANSITIONS=19} [2025-04-13 19:38:16,260 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2025-04-13 19:38:16,260 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 19 transitions, 103 flow [2025-04-13 19:38:16,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:38:16,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:16,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:16,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:38:16,261 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:38:16,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2048785328, now seen corresponding path program 10 times [2025-04-13 19:38:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:16,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645481787] [2025-04-13 19:38:16,261 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:38:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:16,274 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 19:38:16,280 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:38:16,280 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:38:16,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:16,624 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:38:16,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:16,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645481787] [2025-04-13 19:38:16,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645481787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:16,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:16,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:38:16,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414126930] [2025-04-13 19:38:16,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:16,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:38:16,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:16,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:38:16,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:38:16,626 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2025-04-13 19:38:16,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 19 transitions, 103 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:38:16,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:16,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2025-04-13 19:38:16,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:16,726 INFO L116 PetriNetUnfolderBase]: 31/77 cut-off events. [2025-04-13 19:38:16,726 INFO L117 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-04-13 19:38:16,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 77 events. 31/77 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 4 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 252. Up to 37 conditions per place. [2025-04-13 19:38:16,727 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2025-04-13 19:38:16,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 26 transitions, 172 flow [2025-04-13 19:38:16,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:38:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:38:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2025-04-13 19:38:16,728 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.1722689075630252 [2025-04-13 19:38:16,728 INFO L175 Difference]: Start difference. First operand has 57 places, 19 transitions, 103 flow. Second operand 7 states and 41 transitions. [2025-04-13 19:38:16,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 26 transitions, 172 flow [2025-04-13 19:38:16,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 117 flow, removed 3 selfloop flow, removed 20 redundant places. [2025-04-13 19:38:16,729 INFO L231 Difference]: Finished difference. Result has 32 places, 0 transitions, 0 flow [2025-04-13 19:38:16,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=32, PETRI_TRANSITIONS=0} [2025-04-13 19:38:16,729 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2025-04-13 19:38:16,729 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 0 transitions, 0 flow [2025-04-13 19:38:16,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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:38:16,731 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-13 19:38:16,732 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-13 19:38:16,732 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 19:38:16,732 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 19:38:16,732 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 19:38:16,732 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 19:38:16,732 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-04-13 19:38:16,732 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-04-13 19:38:16,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:38:16,733 INFO L422 BasicCegarLoop]: Path program histogram: [10, 2, 1] [2025-04-13 19:38:16,735 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:38:16,735 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:38:16,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:38:16 BasicIcfg [2025-04-13 19:38:16,741 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:38:16,741 INFO L158 Benchmark]: Toolchain (without parser) took 9316.33ms. Allocated memory was 155.2MB in the beginning and 465.6MB in the end (delta: 310.4MB). Free memory was 107.6MB in the beginning and 386.3MB in the end (delta: -278.6MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. [2025-04-13 19:38:16,742 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:38:16,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.24ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 73.8MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 19:38:16,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.13ms. Allocated memory is still 155.2MB. Free memory was 73.8MB in the beginning and 70.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:38:16,743 INFO L158 Benchmark]: Boogie Preprocessor took 65.09ms. Allocated memory is still 155.2MB. Free memory was 70.8MB in the beginning and 67.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:38:16,743 INFO L158 Benchmark]: RCFGBuilder took 684.85ms. Allocated memory is still 155.2MB. Free memory was 67.5MB in the beginning and 76.6MB in the end (delta: -9.2MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. [2025-04-13 19:38:16,744 INFO L158 Benchmark]: TraceAbstraction took 8095.08ms. Allocated memory was 155.2MB in the beginning and 465.6MB in the end (delta: 310.4MB). Free memory was 76.6MB in the beginning and 386.3MB in the end (delta: -309.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:38:16,744 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.21ms. Allocated memory is still 163.6MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 421.24ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 73.8MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.13ms. Allocated memory is still 155.2MB. Free memory was 73.8MB in the beginning and 70.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.09ms. Allocated memory is still 155.2MB. Free memory was 70.8MB in the beginning and 67.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 684.85ms. Allocated memory is still 155.2MB. Free memory was 67.5MB in the beginning and 76.6MB in the end (delta: -9.2MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. * TraceAbstraction took 8095.08ms. Allocated memory was 155.2MB in the beginning and 465.6MB in the end (delta: 310.4MB). Free memory was 76.6MB in the beginning and 386.3MB in the end (delta: -309.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3885]: 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: 3885]: 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: 3885]: 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: 3885]: 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: 3885]: 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: 3885]: 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 4 procedures, 36 locations, 43 edges, 8 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: 8.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1845 IncrementalHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 0 mSDtfsCounter, 1845 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=8, InterpolantAutomatonStates: 75, 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.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 2481 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:38:16,758 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...