./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edceb7bcc6473f68e1454dc7ab02ec33e8dca99fdd725419b9e71852c466530e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:12:02,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:12:02,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:12:02,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:12:02,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:12:02,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:12:02,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:12:02,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:12:02,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:12:02,654 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:12:02,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:12:02,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:12:02,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:12:02,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:12:02,655 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:12:02,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:12:02,656 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:12:02,657 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:12:02,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:12:02,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:12:02,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:12:02,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:12:02,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:12:02,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:12:02,658 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:12:02,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:12:02,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:12:02,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:12:02,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:12:02,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:12:02,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:12:02,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:12:02,658 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edceb7bcc6473f68e1454dc7ab02ec33e8dca99fdd725419b9e71852c466530e [2025-03-04 02:12:02,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:12:02,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:12:02,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:12:02,890 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:12:02,890 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:12:02,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2025-03-04 02:12:04,031 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae214c2b7/df1f02e7df884354afc236d389edaf69/FLAG76cdcb1e3 [2025-03-04 02:12:04,432 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:12:04,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2025-03-04 02:12:04,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae214c2b7/df1f02e7df884354afc236d389edaf69/FLAG76cdcb1e3 [2025-03-04 02:12:04,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae214c2b7/df1f02e7df884354afc236d389edaf69 [2025-03-04 02:12:04,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:12:04,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:12:04,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:12:04,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:12:04,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:12:04,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:04,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28828d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04, skipping insertion in model container [2025-03-04 02:12:04,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:04,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:12:04,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[186203,186216] [2025-03-04 02:12:04,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:12:04,915 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:12:04,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[186203,186216] [2025-03-04 02:12:04,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:12:04,987 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:12:04,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04 WrapperNode [2025-03-04 02:12:04,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:12:04,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:12:04,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:12:04,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:12:04,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,018 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 126 [2025-03-04 02:12:05,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:12:05,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:12:05,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:12:05,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:12:05,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,046 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 13, 2]. 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, 6, 2]. [2025-03-04 02:12:05,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:12:05,081 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:12:05,081 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:12:05,081 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:12:05,082 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (1/1) ... [2025-03-04 02:12:05,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:12:05,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:12:05,112 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-03-04 02:12:05,114 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-03-04 02:12:05,132 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-04 02:12:05,132 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-04 02:12:05,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:12:05,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:12:05,133 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:12:05,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:12:05,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:12:05,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:12:05,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:12:05,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:12:05,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:12:05,133 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:12:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:12:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:12:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:12:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:12:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:12:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:12:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:12:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:12:05,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:12:05,136 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:12:05,366 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:12:05,368 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:12:05,582 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:12:05,582 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:12:05,694 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:12:05,695 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:12:05,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:12:05 BoogieIcfgContainer [2025-03-04 02:12:05,695 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:12:05,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:12:05,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:12:05,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:12:05,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:12:04" (1/3) ... [2025-03-04 02:12:05,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d60b573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:12:05, skipping insertion in model container [2025-03-04 02:12:05,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:12:04" (2/3) ... [2025-03-04 02:12:05,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d60b573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:12:05, skipping insertion in model container [2025-03-04 02:12:05,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:12:05" (3/3) ... [2025-03-04 02:12:05,703 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2025-03-04 02:12:05,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:12:05,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_1-container_of.i that has 2 procedures, 46 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 02:12:05,715 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:12:05,767 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:12:05,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2025-03-04 02:12:05,817 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2025-03-04 02:12:05,821 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:12:05,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 10/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2025-03-04 02:12:05,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2025-03-04 02:12:05,825 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2025-03-04 02:12:05,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:12:05,839 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@308f5eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:12:05,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 02:12:05,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:12:05,846 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 02:12:05,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:12:05,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:05,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 02:12:05,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:05,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash 11330651, now seen corresponding path program 1 times [2025-03-04 02:12:05,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033026188] [2025-03-04 02:12:05,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:05,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 02:12:06,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 02:12:06,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:06,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:06,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:06,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033026188] [2025-03-04 02:12:06,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033026188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:06,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:06,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:12:06,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745925168] [2025-03-04 02:12:06,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:06,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:12:06,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:06,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:12:06,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:12:06,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:06,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-03-04 02:12:06,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:06,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:06,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:06,594 INFO L124 PetriNetUnfolderBase]: 466/828 cut-off events. [2025-03-04 02:12:06,594 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 02:12:06,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 828 events. 466/828 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3485 event pairs, 345 based on Foata normal form. 3/827 useless extension candidates. Maximal degree in co-relation 1543. Up to 602 conditions per place. [2025-03-04 02:12:06,602 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2025-03-04 02:12:06,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2025-03-04 02:12:06,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:12:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:12:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-04 02:12:06,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-04 02:12:06,614 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2025-03-04 02:12:06,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2025-03-04 02:12:06,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 02:12:06,620 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2025-03-04 02:12:06,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-03-04 02:12:06,624 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2025-03-04 02:12:06,624 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2025-03-04 02:12:06,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-03-04 02:12:06,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:06,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:12:06,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:12:06,624 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:06,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:06,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1996087732, now seen corresponding path program 1 times [2025-03-04 02:12:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:06,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879592603] [2025-03-04 02:12:06,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:06,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:06,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:12:06,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:12:06,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:06,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:06,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:06,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879592603] [2025-03-04 02:12:06,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879592603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:06,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:06,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:12:06,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053287232] [2025-03-04 02:12:06,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:06,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:12:06,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:06,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:12:06,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:12:06,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:06,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:06,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:06,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:06,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:07,003 INFO L124 PetriNetUnfolderBase]: 466/821 cut-off events. [2025-03-04 02:12:07,003 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-04 02:12:07,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 821 events. 466/821 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3467 event pairs, 155 based on Foata normal form. 1/821 useless extension candidates. Maximal degree in co-relation 818. Up to 553 conditions per place. [2025-03-04 02:12:07,010 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 47 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2025-03-04 02:12:07,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 265 flow [2025-03-04 02:12:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:12:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:12:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-04 02:12:07,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-03-04 02:12:07,013 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 109 transitions. [2025-03-04 02:12:07,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 265 flow [2025-03-04 02:12:07,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:12:07,015 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2025-03-04 02:12:07,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-03-04 02:12:07,016 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-03-04 02:12:07,016 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2025-03-04 02:12:07,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:07,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:07,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:07,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:12:07,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:07,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1937579247, now seen corresponding path program 1 times [2025-03-04 02:12:07,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:07,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875860471] [2025-03-04 02:12:07,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:07,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:12:07,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:12:07,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:07,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:07,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:07,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875860471] [2025-03-04 02:12:07,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875860471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:07,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:07,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:12:07,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220869544] [2025-03-04 02:12:07,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:07,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:12:07,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:07,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:12:07,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:12:07,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:07,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-04 02:12:07,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:07,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:07,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:07,472 INFO L124 PetriNetUnfolderBase]: 562/1029 cut-off events. [2025-03-04 02:12:07,473 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-03-04 02:12:07,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 1029 events. 562/1029 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4902 event pairs, 252 based on Foata normal form. 64/1092 useless extension candidates. Maximal degree in co-relation 228. Up to 545 conditions per place. [2025-03-04 02:12:07,479 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 49 selfloop transitions, 10 changer transitions 4/67 dead transitions. [2025-03-04 02:12:07,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2025-03-04 02:12:07,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:12:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:12:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-03-04 02:12:07,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-04 02:12:07,483 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2025-03-04 02:12:07,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2025-03-04 02:12:07,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 02:12:07,487 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 150 flow [2025-03-04 02:12:07,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-03-04 02:12:07,488 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-03-04 02:12:07,488 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 150 flow [2025-03-04 02:12:07,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-04 02:12:07,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:07,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:07,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:12:07,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:07,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:07,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2131125183, now seen corresponding path program 1 times [2025-03-04 02:12:07,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:07,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596516634] [2025-03-04 02:12:07,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:07,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:07,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 02:12:07,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 02:12:07,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:07,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:07,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:07,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596516634] [2025-03-04 02:12:07,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596516634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:07,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:07,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:12:07,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699407050] [2025-03-04 02:12:07,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:07,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:12:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:07,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:12:07,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:12:07,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 02:12:07,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-03-04 02:12:07,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:07,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 02:12:07,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:07,751 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2025-03-04 02:12:07,751 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-03-04 02:12:07,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 408 events. 225/408 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1425 event pairs, 46 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 927. Up to 217 conditions per place. [2025-03-04 02:12:07,753 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-04 02:12:07,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 278 flow [2025-03-04 02:12:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:12:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:12:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-03-04 02:12:07,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2025-03-04 02:12:07,754 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 150 flow. Second operand 4 states and 131 transitions. [2025-03-04 02:12:07,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 278 flow [2025-03-04 02:12:07,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 248 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:12:07,760 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 96 flow [2025-03-04 02:12:07,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-03-04 02:12:07,761 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2025-03-04 02:12:07,761 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 96 flow [2025-03-04 02:12:07,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-03-04 02:12:07,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:07,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:07,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:12:07,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:07,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:07,763 INFO L85 PathProgramCache]: Analyzing trace with hash -889048815, now seen corresponding path program 1 times [2025-03-04 02:12:07,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:07,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007360510] [2025-03-04 02:12:07,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:07,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:07,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:07,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:07,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:07,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:08,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:08,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007360510] [2025-03-04 02:12:08,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007360510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:08,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:08,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:08,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71024346] [2025-03-04 02:12:08,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:08,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:12:08,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:08,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:12:08,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:12:08,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:08,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:08,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:08,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:08,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:08,628 INFO L124 PetriNetUnfolderBase]: 268/499 cut-off events. [2025-03-04 02:12:08,628 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-03-04 02:12:08,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 499 events. 268/499 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1842 event pairs, 14 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 226. Up to 139 conditions per place. [2025-03-04 02:12:08,630 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 67 selfloop transitions, 21 changer transitions 0/90 dead transitions. [2025-03-04 02:12:08,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 411 flow [2025-03-04 02:12:08,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:12:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:12:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 206 transitions. [2025-03-04 02:12:08,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2861111111111111 [2025-03-04 02:12:08,632 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 96 flow. Second operand 12 states and 206 transitions. [2025-03-04 02:12:08,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 411 flow [2025-03-04 02:12:08,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:12:08,633 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 197 flow [2025-03-04 02:12:08,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=197, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2025-03-04 02:12:08,634 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2025-03-04 02:12:08,634 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 197 flow [2025-03-04 02:12:08,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:12:08,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:08,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:08,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:12:08,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:08,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:08,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1008231267, now seen corresponding path program 2 times [2025-03-04 02:12:08,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:08,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847539481] [2025-03-04 02:12:08,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:12:08,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:08,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:08,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:08,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:08,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:09,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:09,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847539481] [2025-03-04 02:12:09,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847539481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:09,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:09,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:09,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597075562] [2025-03-04 02:12:09,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:09,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:12:09,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:09,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:12:09,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:12:09,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 02:12:09,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 197 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-03-04 02:12:09,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:09,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 02:12:09,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:09,447 INFO L124 PetriNetUnfolderBase]: 300/555 cut-off events. [2025-03-04 02:12:09,447 INFO L125 PetriNetUnfolderBase]: For 511/511 co-relation queries the response was YES. [2025-03-04 02:12:09,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1505 conditions, 555 events. 300/555 cut-off events. For 511/511 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2227 event pairs, 19 based on Foata normal form. 8/563 useless extension candidates. Maximal degree in co-relation 1482. Up to 282 conditions per place. [2025-03-04 02:12:09,450 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 60 selfloop transitions, 30 changer transitions 0/98 dead transitions. [2025-03-04 02:12:09,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 601 flow [2025-03-04 02:12:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:12:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:12:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 294 transitions. [2025-03-04 02:12:09,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-03-04 02:12:09,453 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 197 flow. Second operand 10 states and 294 transitions. [2025-03-04 02:12:09,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 601 flow [2025-03-04 02:12:09,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 569 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 02:12:09,458 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 418 flow [2025-03-04 02:12:09,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=418, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2025-03-04 02:12:09,459 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2025-03-04 02:12:09,459 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 418 flow [2025-03-04 02:12:09,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-03-04 02:12:09,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:09,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:09,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:12:09,460 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:09,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2073951171, now seen corresponding path program 3 times [2025-03-04 02:12:09,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:09,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232859918] [2025-03-04 02:12:09,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:12:09,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:09,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:09,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:09,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:12:09,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:10,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:10,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232859918] [2025-03-04 02:12:10,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232859918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:10,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:10,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:12:10,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531124367] [2025-03-04 02:12:10,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:10,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:12:10,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:10,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:12:10,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:12:10,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:10,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 418 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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-03-04 02:12:10,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:10,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:10,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:10,828 INFO L124 PetriNetUnfolderBase]: 389/724 cut-off events. [2025-03-04 02:12:10,828 INFO L125 PetriNetUnfolderBase]: For 910/910 co-relation queries the response was YES. [2025-03-04 02:12:10,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2417 conditions, 724 events. 389/724 cut-off events. For 910/910 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3081 event pairs, 18 based on Foata normal form. 1/725 useless extension candidates. Maximal degree in co-relation 2384. Up to 153 conditions per place. [2025-03-04 02:12:10,833 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 93 selfloop transitions, 45 changer transitions 0/140 dead transitions. [2025-03-04 02:12:10,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 140 transitions, 984 flow [2025-03-04 02:12:10,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:12:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:12:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 268 transitions. [2025-03-04 02:12:10,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2791666666666667 [2025-03-04 02:12:10,835 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 418 flow. Second operand 16 states and 268 transitions. [2025-03-04 02:12:10,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 140 transitions, 984 flow [2025-03-04 02:12:10,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 140 transitions, 982 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:12:10,841 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 634 flow [2025-03-04 02:12:10,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=634, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2025-03-04 02:12:10,842 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2025-03-04 02:12:10,842 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 634 flow [2025-03-04 02:12:10,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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-03-04 02:12:10,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:10,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:10,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:12:10,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:10,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1869156349, now seen corresponding path program 4 times [2025-03-04 02:12:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909031426] [2025-03-04 02:12:10,844 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:12:10,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:10,864 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 02:12:10,877 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:10,877 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:12:10,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909031426] [2025-03-04 02:12:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909031426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:11,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:11,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:11,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047900391] [2025-03-04 02:12:11,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:11,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:12:11,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:11,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:12:11,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:12:11,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 02:12:11,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 81 transitions, 634 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-03-04 02:12:11,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:11,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 02:12:11,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:11,573 INFO L124 PetriNetUnfolderBase]: 634/1181 cut-off events. [2025-03-04 02:12:11,574 INFO L125 PetriNetUnfolderBase]: For 3189/3189 co-relation queries the response was YES. [2025-03-04 02:12:11,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 1181 events. 634/1181 cut-off events. For 3189/3189 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5932 event pairs, 102 based on Foata normal form. 8/1189 useless extension candidates. Maximal degree in co-relation 4309. Up to 369 conditions per place. [2025-03-04 02:12:11,581 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 102 selfloop transitions, 49 changer transitions 0/160 dead transitions. [2025-03-04 02:12:11,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 160 transitions, 1462 flow [2025-03-04 02:12:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:12:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:12:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 339 transitions. [2025-03-04 02:12:11,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2025-03-04 02:12:11,583 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 634 flow. Second operand 11 states and 339 transitions. [2025-03-04 02:12:11,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 160 transitions, 1462 flow [2025-03-04 02:12:11,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 160 transitions, 1405 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 02:12:11,598 INFO L231 Difference]: Finished difference. Result has 95 places, 104 transitions, 999 flow [2025-03-04 02:12:11,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=999, PETRI_PLACES=95, PETRI_TRANSITIONS=104} [2025-03-04 02:12:11,601 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2025-03-04 02:12:11,601 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 104 transitions, 999 flow [2025-03-04 02:12:11,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-03-04 02:12:11,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:11,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:11,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:12:11,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:11,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:11,602 INFO L85 PathProgramCache]: Analyzing trace with hash -564419071, now seen corresponding path program 5 times [2025-03-04 02:12:11,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:11,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258991962] [2025-03-04 02:12:11,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:12:11,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:11,620 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:11,629 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:11,629 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:11,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258991962] [2025-03-04 02:12:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258991962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:11,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:11,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:11,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572509115] [2025-03-04 02:12:11,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:11,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:12:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:11,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:12:11,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:12:11,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 02:12:11,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 104 transitions, 999 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-03-04 02:12:11,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:11,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 02:12:11,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:12,379 INFO L124 PetriNetUnfolderBase]: 646/1215 cut-off events. [2025-03-04 02:12:12,379 INFO L125 PetriNetUnfolderBase]: For 5344/5344 co-relation queries the response was YES. [2025-03-04 02:12:12,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5223 conditions, 1215 events. 646/1215 cut-off events. For 5344/5344 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6245 event pairs, 52 based on Foata normal form. 12/1227 useless extension candidates. Maximal degree in co-relation 5171. Up to 489 conditions per place. [2025-03-04 02:12:12,388 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 93 selfloop transitions, 78 changer transitions 0/180 dead transitions. [2025-03-04 02:12:12,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 180 transitions, 2010 flow [2025-03-04 02:12:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:12:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:12:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 348 transitions. [2025-03-04 02:12:12,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-04 02:12:12,390 INFO L175 Difference]: Start difference. First operand has 95 places, 104 transitions, 999 flow. Second operand 12 states and 348 transitions. [2025-03-04 02:12:12,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 180 transitions, 2010 flow [2025-03-04 02:12:12,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 180 transitions, 1947 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-04 02:12:12,410 INFO L231 Difference]: Finished difference. Result has 107 places, 135 transitions, 1580 flow [2025-03-04 02:12:12,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1580, PETRI_PLACES=107, PETRI_TRANSITIONS=135} [2025-03-04 02:12:12,411 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2025-03-04 02:12:12,411 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 135 transitions, 1580 flow [2025-03-04 02:12:12,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-03-04 02:12:12,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:12,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:12,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:12:12,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:12,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash 476794071, now seen corresponding path program 6 times [2025-03-04 02:12:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:12,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454310958] [2025-03-04 02:12:12,412 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:12:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:12,427 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:12,435 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:12,435 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:12:12,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:12,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:12,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454310958] [2025-03-04 02:12:12,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454310958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:12,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:12,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:12:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321629393] [2025-03-04 02:12:12,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:12,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:12:12,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:12,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:12:12,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:12:12,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:12,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 135 transitions, 1580 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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-03-04 02:12:12,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:12,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:12,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:13,777 INFO L124 PetriNetUnfolderBase]: 646/1213 cut-off events. [2025-03-04 02:12:13,777 INFO L125 PetriNetUnfolderBase]: For 7055/7055 co-relation queries the response was YES. [2025-03-04 02:12:13,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5722 conditions, 1213 events. 646/1213 cut-off events. For 7055/7055 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6165 event pairs, 62 based on Foata normal form. 1/1214 useless extension candidates. Maximal degree in co-relation 5667. Up to 377 conditions per place. [2025-03-04 02:12:13,784 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 135 selfloop transitions, 85 changer transitions 0/222 dead transitions. [2025-03-04 02:12:13,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 222 transitions, 2584 flow [2025-03-04 02:12:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:12:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:12:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 293 transitions. [2025-03-04 02:12:13,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2872549019607843 [2025-03-04 02:12:13,787 INFO L175 Difference]: Start difference. First operand has 107 places, 135 transitions, 1580 flow. Second operand 17 states and 293 transitions. [2025-03-04 02:12:13,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 222 transitions, 2584 flow [2025-03-04 02:12:13,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 222 transitions, 2487 flow, removed 28 selfloop flow, removed 5 redundant places. [2025-03-04 02:12:13,808 INFO L231 Difference]: Finished difference. Result has 127 places, 150 transitions, 1979 flow [2025-03-04 02:12:13,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1979, PETRI_PLACES=127, PETRI_TRANSITIONS=150} [2025-03-04 02:12:13,808 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 74 predicate places. [2025-03-04 02:12:13,809 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 150 transitions, 1979 flow [2025-03-04 02:12:13,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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-03-04 02:12:13,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:13,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:13,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:12:13,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:13,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:13,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1456827013, now seen corresponding path program 7 times [2025-03-04 02:12:13,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:13,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245662775] [2025-03-04 02:12:13,810 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:12:13,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:13,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:13,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:13,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:13,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:14,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:14,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245662775] [2025-03-04 02:12:14,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245662775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:14,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:14,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:12:14,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039120991] [2025-03-04 02:12:14,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:14,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:12:14,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:14,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:12:14,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:12:14,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:14,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 150 transitions, 1979 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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-03-04 02:12:14,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:14,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:14,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:15,335 INFO L124 PetriNetUnfolderBase]: 868/1627 cut-off events. [2025-03-04 02:12:15,336 INFO L125 PetriNetUnfolderBase]: For 11619/11619 co-relation queries the response was YES. [2025-03-04 02:12:15,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7858 conditions, 1627 events. 868/1627 cut-off events. For 11619/11619 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8975 event pairs, 46 based on Foata normal form. 1/1628 useless extension candidates. Maximal degree in co-relation 7791. Up to 313 conditions per place. [2025-03-04 02:12:15,349 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 145 selfloop transitions, 118 changer transitions 0/265 dead transitions. [2025-03-04 02:12:15,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 265 transitions, 3495 flow [2025-03-04 02:12:15,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 02:12:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 02:12:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 305 transitions. [2025-03-04 02:12:15,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2824074074074074 [2025-03-04 02:12:15,352 INFO L175 Difference]: Start difference. First operand has 127 places, 150 transitions, 1979 flow. Second operand 18 states and 305 transitions. [2025-03-04 02:12:15,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 265 transitions, 3495 flow [2025-03-04 02:12:15,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 265 transitions, 3399 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 02:12:15,405 INFO L231 Difference]: Finished difference. Result has 145 places, 177 transitions, 2737 flow [2025-03-04 02:12:15,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2737, PETRI_PLACES=145, PETRI_TRANSITIONS=177} [2025-03-04 02:12:15,407 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 92 predicate places. [2025-03-04 02:12:15,407 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 177 transitions, 2737 flow [2025-03-04 02:12:15,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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-03-04 02:12:15,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:15,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:15,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:12:15,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:15,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash 753717213, now seen corresponding path program 8 times [2025-03-04 02:12:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:15,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823042596] [2025-03-04 02:12:15,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:12:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:15,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:15,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:15,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:15,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:15,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:15,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823042596] [2025-03-04 02:12:15,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823042596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:15,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:15,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:15,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253707124] [2025-03-04 02:12:15,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:15,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:12:15,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:15,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:12:15,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:12:15,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 02:12:15,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 177 transitions, 2737 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-03-04 02:12:15,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:15,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 02:12:15,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:16,188 INFO L124 PetriNetUnfolderBase]: 890/1673 cut-off events. [2025-03-04 02:12:16,189 INFO L125 PetriNetUnfolderBase]: For 15665/15665 co-relation queries the response was YES. [2025-03-04 02:12:16,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8658 conditions, 1673 events. 890/1673 cut-off events. For 15665/15665 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9425 event pairs, 132 based on Foata normal form. 8/1681 useless extension candidates. Maximal degree in co-relation 8585. Up to 481 conditions per place. [2025-03-04 02:12:16,201 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 127 selfloop transitions, 97 changer transitions 0/236 dead transitions. [2025-03-04 02:12:16,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 236 transitions, 3694 flow [2025-03-04 02:12:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:12:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:12:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 357 transitions. [2025-03-04 02:12:16,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49583333333333335 [2025-03-04 02:12:16,203 INFO L175 Difference]: Start difference. First operand has 145 places, 177 transitions, 2737 flow. Second operand 12 states and 357 transitions. [2025-03-04 02:12:16,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 236 transitions, 3694 flow [2025-03-04 02:12:16,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 236 transitions, 3604 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-04 02:12:16,298 INFO L231 Difference]: Finished difference. Result has 155 places, 188 transitions, 3138 flow [2025-03-04 02:12:16,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2659, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3138, PETRI_PLACES=155, PETRI_TRANSITIONS=188} [2025-03-04 02:12:16,299 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 102 predicate places. [2025-03-04 02:12:16,299 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 188 transitions, 3138 flow [2025-03-04 02:12:16,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 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-03-04 02:12:16,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:16,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:16,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:12:16,299 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:16,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash -323835375, now seen corresponding path program 9 times [2025-03-04 02:12:16,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:16,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879094589] [2025-03-04 02:12:16,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:12:16,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:16,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:12:16,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:12:16,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:12:16,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879094589] [2025-03-04 02:12:16,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879094589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:12:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184650554] [2025-03-04 02:12:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:16,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:12:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:16,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:12:16,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:12:16,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:16,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 188 transitions, 3138 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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-03-04 02:12:16,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:16,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:16,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:17,712 INFO L124 PetriNetUnfolderBase]: 890/1671 cut-off events. [2025-03-04 02:12:17,713 INFO L125 PetriNetUnfolderBase]: For 18052/18052 co-relation queries the response was YES. [2025-03-04 02:12:17,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9387 conditions, 1671 events. 890/1671 cut-off events. For 18052/18052 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9323 event pairs, 135 based on Foata normal form. 1/1672 useless extension candidates. Maximal degree in co-relation 9313. Up to 356 conditions per place. [2025-03-04 02:12:17,733 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 162 selfloop transitions, 114 changer transitions 0/277 dead transitions. [2025-03-04 02:12:17,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 277 transitions, 4352 flow [2025-03-04 02:12:17,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 02:12:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 02:12:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 321 transitions. [2025-03-04 02:12:17,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28157894736842104 [2025-03-04 02:12:17,736 INFO L175 Difference]: Start difference. First operand has 155 places, 188 transitions, 3138 flow. Second operand 19 states and 321 transitions. [2025-03-04 02:12:17,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 277 transitions, 4352 flow [2025-03-04 02:12:17,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 277 transitions, 4158 flow, removed 44 selfloop flow, removed 8 redundant places. [2025-03-04 02:12:17,804 INFO L231 Difference]: Finished difference. Result has 167 places, 194 transitions, 3476 flow [2025-03-04 02:12:17,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2989, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3476, PETRI_PLACES=167, PETRI_TRANSITIONS=194} [2025-03-04 02:12:17,805 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 114 predicate places. [2025-03-04 02:12:17,805 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 194 transitions, 3476 flow [2025-03-04 02:12:17,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 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-03-04 02:12:17,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:17,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:17,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:12:17,806 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:17,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:17,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1999889587, now seen corresponding path program 1 times [2025-03-04 02:12:17,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:17,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569638658] [2025-03-04 02:12:17,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:12:17,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:17,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:17,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:17,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:17,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:18,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:18,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569638658] [2025-03-04 02:12:18,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569638658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:18,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:18,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 02:12:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115419567] [2025-03-04 02:12:18,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:18,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:12:18,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:18,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:12:18,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:12:18,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:18,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 194 transitions, 3476 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-03-04 02:12:18,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:18,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:18,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:19,093 INFO L124 PetriNetUnfolderBase]: 962/1815 cut-off events. [2025-03-04 02:12:19,093 INFO L125 PetriNetUnfolderBase]: For 22283/22283 co-relation queries the response was YES. [2025-03-04 02:12:19,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10206 conditions, 1815 events. 962/1815 cut-off events. For 22283/22283 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10422 event pairs, 221 based on Foata normal form. 1/1816 useless extension candidates. Maximal degree in co-relation 9882. Up to 1421 conditions per place. [2025-03-04 02:12:19,104 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 137 selfloop transitions, 73 changer transitions 47/258 dead transitions. [2025-03-04 02:12:19,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 258 transitions, 4638 flow [2025-03-04 02:12:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:12:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:12:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 231 transitions. [2025-03-04 02:12:19,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.275 [2025-03-04 02:12:19,105 INFO L175 Difference]: Start difference. First operand has 167 places, 194 transitions, 3476 flow. Second operand 14 states and 231 transitions. [2025-03-04 02:12:19,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 258 transitions, 4638 flow [2025-03-04 02:12:19,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 258 transitions, 4449 flow, removed 18 selfloop flow, removed 11 redundant places. [2025-03-04 02:12:19,178 INFO L231 Difference]: Finished difference. Result has 174 places, 193 transitions, 3489 flow [2025-03-04 02:12:19,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3314, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3489, PETRI_PLACES=174, PETRI_TRANSITIONS=193} [2025-03-04 02:12:19,179 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 121 predicate places. [2025-03-04 02:12:19,179 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 193 transitions, 3489 flow [2025-03-04 02:12:19,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-03-04 02:12:19,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:19,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:19,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:12:19,179 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:19,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:19,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2132970693, now seen corresponding path program 2 times [2025-03-04 02:12:19,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:19,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032846619] [2025-03-04 02:12:19,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:12:19,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:19,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:19,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:19,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:19,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:19,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:19,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032846619] [2025-03-04 02:12:19,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032846619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:19,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:19,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:12:19,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090949897] [2025-03-04 02:12:19,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:19,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:12:19,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:19,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:12:19,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:12:19,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:19,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 193 transitions, 3489 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-03-04 02:12:19,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:19,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:19,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:20,389 INFO L124 PetriNetUnfolderBase]: 941/1780 cut-off events. [2025-03-04 02:12:20,390 INFO L125 PetriNetUnfolderBase]: For 20951/20951 co-relation queries the response was YES. [2025-03-04 02:12:20,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10064 conditions, 1780 events. 941/1780 cut-off events. For 20951/20951 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10224 event pairs, 295 based on Foata normal form. 1/1781 useless extension candidates. Maximal degree in co-relation 9984. Up to 1351 conditions per place. [2025-03-04 02:12:20,401 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 163 selfloop transitions, 57 changer transitions 53/274 dead transitions. [2025-03-04 02:12:20,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 274 transitions, 4909 flow [2025-03-04 02:12:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:12:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:12:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 233 transitions. [2025-03-04 02:12:20,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2773809523809524 [2025-03-04 02:12:20,402 INFO L175 Difference]: Start difference. First operand has 174 places, 193 transitions, 3489 flow. Second operand 14 states and 233 transitions. [2025-03-04 02:12:20,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 274 transitions, 4909 flow [2025-03-04 02:12:20,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 274 transitions, 4651 flow, removed 44 selfloop flow, removed 12 redundant places. [2025-03-04 02:12:20,473 INFO L231 Difference]: Finished difference. Result has 174 places, 194 transitions, 3377 flow [2025-03-04 02:12:20,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3274, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3377, PETRI_PLACES=174, PETRI_TRANSITIONS=194} [2025-03-04 02:12:20,473 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 121 predicate places. [2025-03-04 02:12:20,473 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 194 transitions, 3377 flow [2025-03-04 02:12:20,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-03-04 02:12:20,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:20,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:20,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:12:20,474 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:20,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash 987557807, now seen corresponding path program 3 times [2025-03-04 02:12:20,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:20,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36697781] [2025-03-04 02:12:20,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:12:20,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:20,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:20,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:20,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:12:20,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:21,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36697781] [2025-03-04 02:12:21,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36697781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:21,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 02:12:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591591449] [2025-03-04 02:12:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:21,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 02:12:21,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:21,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 02:12:21,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:12:21,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:21,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 194 transitions, 3377 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-03-04 02:12:21,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:21,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:21,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:21,549 INFO L124 PetriNetUnfolderBase]: 808/1535 cut-off events. [2025-03-04 02:12:21,550 INFO L125 PetriNetUnfolderBase]: For 17571/17571 co-relation queries the response was YES. [2025-03-04 02:12:21,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8595 conditions, 1535 events. 808/1535 cut-off events. For 17571/17571 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8543 event pairs, 263 based on Foata normal form. 1/1536 useless extension candidates. Maximal degree in co-relation 8520. Up to 1245 conditions per place. [2025-03-04 02:12:21,560 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 132 selfloop transitions, 46 changer transitions 56/235 dead transitions. [2025-03-04 02:12:21,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 235 transitions, 4113 flow [2025-03-04 02:12:21,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:12:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:12:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 219 transitions. [2025-03-04 02:12:21,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28076923076923077 [2025-03-04 02:12:21,561 INFO L175 Difference]: Start difference. First operand has 174 places, 194 transitions, 3377 flow. Second operand 13 states and 219 transitions. [2025-03-04 02:12:21,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 235 transitions, 4113 flow [2025-03-04 02:12:21,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 235 transitions, 3922 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-03-04 02:12:21,617 INFO L231 Difference]: Finished difference. Result has 175 places, 165 transitions, 2831 flow [2025-03-04 02:12:21,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3186, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2831, PETRI_PLACES=175, PETRI_TRANSITIONS=165} [2025-03-04 02:12:21,617 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 122 predicate places. [2025-03-04 02:12:21,618 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 165 transitions, 2831 flow [2025-03-04 02:12:21,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 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-03-04 02:12:21,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:21,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:21,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:12:21,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:21,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1072325331, now seen corresponding path program 4 times [2025-03-04 02:12:21,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:21,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077890533] [2025-03-04 02:12:21,619 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:12:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:21,631 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:21,639 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:21,639 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:12:21,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:21,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:21,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077890533] [2025-03-04 02:12:21,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077890533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:21,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:21,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:12:21,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295454158] [2025-03-04 02:12:21,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:21,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:12:21,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:21,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:12:21,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:12:21,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 02:12:21,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 165 transitions, 2831 flow. Second operand has 9 states, 9 states have (on average 24.88888888888889) internal successors, (224), 9 states have internal predecessors, (224), 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-03-04 02:12:21,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:21,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 02:12:21,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:22,285 INFO L124 PetriNetUnfolderBase]: 654/1255 cut-off events. [2025-03-04 02:12:22,285 INFO L125 PetriNetUnfolderBase]: For 13170/13170 co-relation queries the response was YES. [2025-03-04 02:12:22,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6861 conditions, 1255 events. 654/1255 cut-off events. For 13170/13170 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6687 event pairs, 101 based on Foata normal form. 12/1267 useless extension candidates. Maximal degree in co-relation 6794. Up to 651 conditions per place. [2025-03-04 02:12:22,293 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 98 selfloop transitions, 75 changer transitions 3/186 dead transitions. [2025-03-04 02:12:22,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 186 transitions, 3158 flow [2025-03-04 02:12:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:12:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 02:12:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 327 transitions. [2025-03-04 02:12:22,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954545454545455 [2025-03-04 02:12:22,294 INFO L175 Difference]: Start difference. First operand has 175 places, 165 transitions, 2831 flow. Second operand 11 states and 327 transitions. [2025-03-04 02:12:22,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 186 transitions, 3158 flow [2025-03-04 02:12:22,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 186 transitions, 2919 flow, removed 23 selfloop flow, removed 26 redundant places. [2025-03-04 02:12:22,339 INFO L231 Difference]: Finished difference. Result has 152 places, 161 transitions, 2664 flow [2025-03-04 02:12:22,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2471, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2664, PETRI_PLACES=152, PETRI_TRANSITIONS=161} [2025-03-04 02:12:22,340 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 99 predicate places. [2025-03-04 02:12:22,340 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 161 transitions, 2664 flow [2025-03-04 02:12:22,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.88888888888889) internal successors, (224), 9 states have internal predecessors, (224), 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-03-04 02:12:22,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:22,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:22,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:12:22,341 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:22,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1637876969, now seen corresponding path program 5 times [2025-03-04 02:12:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:22,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299827262] [2025-03-04 02:12:22,341 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:12:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:22,356 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:22,369 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:22,369 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:12:22,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:22,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299827262] [2025-03-04 02:12:22,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299827262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:22,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:22,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 02:12:22,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927059708] [2025-03-04 02:12:22,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:22,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:12:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:22,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:12:22,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:12:22,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:22,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 161 transitions, 2664 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-03-04 02:12:22,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:22,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:22,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:23,454 INFO L124 PetriNetUnfolderBase]: 709/1358 cut-off events. [2025-03-04 02:12:23,454 INFO L125 PetriNetUnfolderBase]: For 14165/14165 co-relation queries the response was YES. [2025-03-04 02:12:23,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 1358 events. 709/1358 cut-off events. For 14165/14165 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7390 event pairs, 185 based on Foata normal form. 1/1359 useless extension candidates. Maximal degree in co-relation 7221. Up to 983 conditions per place. [2025-03-04 02:12:23,462 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 116 selfloop transitions, 39 changer transitions 44/200 dead transitions. [2025-03-04 02:12:23,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 200 transitions, 3303 flow [2025-03-04 02:12:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:12:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 02:12:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 239 transitions. [2025-03-04 02:12:23,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26555555555555554 [2025-03-04 02:12:23,465 INFO L175 Difference]: Start difference. First operand has 152 places, 161 transitions, 2664 flow. Second operand 15 states and 239 transitions. [2025-03-04 02:12:23,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 200 transitions, 3303 flow [2025-03-04 02:12:23,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 200 transitions, 3149 flow, removed 10 selfloop flow, removed 9 redundant places. [2025-03-04 02:12:23,507 INFO L231 Difference]: Finished difference. Result has 159 places, 136 transitions, 2193 flow [2025-03-04 02:12:23,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2514, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2193, PETRI_PLACES=159, PETRI_TRANSITIONS=136} [2025-03-04 02:12:23,508 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 106 predicate places. [2025-03-04 02:12:23,508 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 136 transitions, 2193 flow [2025-03-04 02:12:23,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-03-04 02:12:23,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:23,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:23,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 02:12:23,508 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:23,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1230900875, now seen corresponding path program 6 times [2025-03-04 02:12:23,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:23,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70157819] [2025-03-04 02:12:23,509 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:12:23,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:23,520 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:23,525 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:23,526 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:12:23,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:23,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70157819] [2025-03-04 02:12:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70157819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:23,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:23,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:12:23,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771677186] [2025-03-04 02:12:23,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:23,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:12:23,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:23,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:12:23,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:12:23,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 02:12:23,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 136 transitions, 2193 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-03-04 02:12:23,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:23,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 02:12:23,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:24,034 INFO L124 PetriNetUnfolderBase]: 521/1018 cut-off events. [2025-03-04 02:12:24,035 INFO L125 PetriNetUnfolderBase]: For 9761/9761 co-relation queries the response was YES. [2025-03-04 02:12:24,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5385 conditions, 1018 events. 521/1018 cut-off events. For 9761/9761 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5237 event pairs, 58 based on Foata normal form. 18/1036 useless extension candidates. Maximal degree in co-relation 5328. Up to 408 conditions per place. [2025-03-04 02:12:24,041 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 93 selfloop transitions, 69 changer transitions 0/171 dead transitions. [2025-03-04 02:12:24,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 171 transitions, 2593 flow [2025-03-04 02:12:24,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:12:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 02:12:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 354 transitions. [2025-03-04 02:12:24,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2025-03-04 02:12:24,042 INFO L175 Difference]: Start difference. First operand has 159 places, 136 transitions, 2193 flow. Second operand 12 states and 354 transitions. [2025-03-04 02:12:24,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 171 transitions, 2593 flow [2025-03-04 02:12:24,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 171 transitions, 2230 flow, removed 29 selfloop flow, removed 25 redundant places. [2025-03-04 02:12:24,069 INFO L231 Difference]: Finished difference. Result has 126 places, 140 transitions, 2007 flow [2025-03-04 02:12:24,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1741, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2007, PETRI_PLACES=126, PETRI_TRANSITIONS=140} [2025-03-04 02:12:24,069 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 73 predicate places. [2025-03-04 02:12:24,069 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 140 transitions, 2007 flow [2025-03-04 02:12:24,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 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-03-04 02:12:24,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:24,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:24,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 02:12:24,069 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:24,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash 404091283, now seen corresponding path program 7 times [2025-03-04 02:12:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:24,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825395878] [2025-03-04 02:12:24,070 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:12:24,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:24,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:24,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:24,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:24,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:24,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825395878] [2025-03-04 02:12:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825395878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:24,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 02:12:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716280968] [2025-03-04 02:12:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:24,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:12:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:24,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:12:24,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:12:24,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:24,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 140 transitions, 2007 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-03-04 02:12:24,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:24,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:24,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:25,089 INFO L124 PetriNetUnfolderBase]: 521/1016 cut-off events. [2025-03-04 02:12:25,089 INFO L125 PetriNetUnfolderBase]: For 9187/9187 co-relation queries the response was YES. [2025-03-04 02:12:25,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5332 conditions, 1016 events. 521/1016 cut-off events. For 9187/9187 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5099 event pairs, 91 based on Foata normal form. 1/1017 useless extension candidates. Maximal degree in co-relation 4968. Up to 467 conditions per place. [2025-03-04 02:12:25,095 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 119 selfloop transitions, 52 changer transitions 41/213 dead transitions. [2025-03-04 02:12:25,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 213 transitions, 3085 flow [2025-03-04 02:12:25,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:12:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:12:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 257 transitions. [2025-03-04 02:12:25,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2677083333333333 [2025-03-04 02:12:25,098 INFO L175 Difference]: Start difference. First operand has 126 places, 140 transitions, 2007 flow. Second operand 16 states and 257 transitions. [2025-03-04 02:12:25,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 213 transitions, 3085 flow [2025-03-04 02:12:25,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 213 transitions, 2969 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-04 02:12:25,132 INFO L231 Difference]: Finished difference. Result has 138 places, 138 transitions, 2011 flow [2025-03-04 02:12:25,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2011, PETRI_PLACES=138, PETRI_TRANSITIONS=138} [2025-03-04 02:12:25,133 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 85 predicate places. [2025-03-04 02:12:25,133 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 138 transitions, 2011 flow [2025-03-04 02:12:25,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-03-04 02:12:25,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:25,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:25,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 02:12:25,133 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:25,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1459080375, now seen corresponding path program 8 times [2025-03-04 02:12:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:25,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202134280] [2025-03-04 02:12:25,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:12:25,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:25,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:25,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:25,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:12:25,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:25,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202134280] [2025-03-04 02:12:25,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202134280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:12:25,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:12:25,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:12:25,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800602765] [2025-03-04 02:12:25,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:12:25,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:12:25,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:25,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:12:25,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:12:25,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-04 02:12:25,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 138 transitions, 2011 flow. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 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-03-04 02:12:25,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:25,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-04 02:12:25,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:25,795 INFO L124 PetriNetUnfolderBase]: 323/664 cut-off events. [2025-03-04 02:12:25,795 INFO L125 PetriNetUnfolderBase]: For 6525/6525 co-relation queries the response was YES. [2025-03-04 02:12:25,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 664 events. 323/664 cut-off events. For 6525/6525 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3085 event pairs, 41 based on Foata normal form. 12/676 useless extension candidates. Maximal degree in co-relation 3599. Up to 224 conditions per place. [2025-03-04 02:12:25,799 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 85 selfloop transitions, 66 changer transitions 1/159 dead transitions. [2025-03-04 02:12:25,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 159 transitions, 2337 flow [2025-03-04 02:12:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:12:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 02:12:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 298 transitions. [2025-03-04 02:12:25,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.382051282051282 [2025-03-04 02:12:25,800 INFO L175 Difference]: Start difference. First operand has 138 places, 138 transitions, 2011 flow. Second operand 13 states and 298 transitions. [2025-03-04 02:12:25,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 159 transitions, 2337 flow [2025-03-04 02:12:25,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 159 transitions, 2072 flow, removed 31 selfloop flow, removed 16 redundant places. [2025-03-04 02:12:25,816 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 1882 flow [2025-03-04 02:12:25,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1627, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1882, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2025-03-04 02:12:25,816 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 83 predicate places. [2025-03-04 02:12:25,816 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 1882 flow [2025-03-04 02:12:25,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 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-03-04 02:12:25,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:25,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:25,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 02:12:25,817 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:25,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:25,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1502042303, now seen corresponding path program 9 times [2025-03-04 02:12:25,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:25,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680273471] [2025-03-04 02:12:25,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:12:25,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:25,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:25,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:25,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:12:25,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:26,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:26,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680273471] [2025-03-04 02:12:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680273471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:12:26,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619929975] [2025-03-04 02:12:26,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:12:26,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:12:26,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:12:26,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:12:26,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:12:26,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:26,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:26,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 02:12:26,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:26,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 02:12:26,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:12:26,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 02:12:26,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2025-03-04 02:12:26,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-03-04 02:12:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:26,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:12:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:27,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619929975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:12:27,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:12:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 27 [2025-03-04 02:12:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715887336] [2025-03-04 02:12:27,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:12:27,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 02:12:27,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:27,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 02:12:27,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:12:27,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:27,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 1882 flow. Second operand has 27 states, 27 states have (on average 12.851851851851851) internal successors, (347), 27 states have internal predecessors, (347), 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-03-04 02:12:27,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:27,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:27,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:28,268 INFO L124 PetriNetUnfolderBase]: 322/661 cut-off events. [2025-03-04 02:12:28,269 INFO L125 PetriNetUnfolderBase]: For 6232/6232 co-relation queries the response was YES. [2025-03-04 02:12:28,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3557 conditions, 661 events. 322/661 cut-off events. For 6232/6232 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2987 event pairs, 90 based on Foata normal form. 1/662 useless extension candidates. Maximal degree in co-relation 3307. Up to 447 conditions per place. [2025-03-04 02:12:28,273 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 84 selfloop transitions, 33 changer transitions 44/162 dead transitions. [2025-03-04 02:12:28,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 162 transitions, 2374 flow [2025-03-04 02:12:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:12:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:12:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 243 transitions. [2025-03-04 02:12:28,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.253125 [2025-03-04 02:12:28,274 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 1882 flow. Second operand 16 states and 243 transitions. [2025-03-04 02:12:28,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 162 transitions, 2374 flow [2025-03-04 02:12:28,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 162 transitions, 2203 flow, removed 25 selfloop flow, removed 10 redundant places. [2025-03-04 02:12:28,291 INFO L231 Difference]: Finished difference. Result has 142 places, 110 transitions, 1421 flow [2025-03-04 02:12:28,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1735, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1421, PETRI_PLACES=142, PETRI_TRANSITIONS=110} [2025-03-04 02:12:28,291 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 89 predicate places. [2025-03-04 02:12:28,291 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 110 transitions, 1421 flow [2025-03-04 02:12:28,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.851851851851851) internal successors, (347), 27 states have internal predecessors, (347), 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-03-04 02:12:28,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:28,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:28,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:12:28,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 02:12:28,493 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:28,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash -445674559, now seen corresponding path program 10 times [2025-03-04 02:12:28,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:28,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893481502] [2025-03-04 02:12:28,493 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:12:28,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:28,509 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:28,518 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:28,518 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:12:28,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:28,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893481502] [2025-03-04 02:12:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893481502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:12:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609862773] [2025-03-04 02:12:28,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:12:28,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:12:28,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:12:28,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:12:28,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:12:29,078 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:29,107 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:29,107 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:12:29,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:29,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-04 02:12:29,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:12:29,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 02:12:29,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-04 02:12:29,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-03-04 02:12:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:29,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:12:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:29,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609862773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:12:29,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:12:29,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2025-03-04 02:12:29,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733170446] [2025-03-04 02:12:29,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:12:29,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 02:12:29,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:29,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 02:12:29,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2025-03-04 02:12:29,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:29,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 110 transitions, 1421 flow. Second operand has 28 states, 28 states have (on average 12.785714285714286) internal successors, (358), 28 states have internal predecessors, (358), 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-03-04 02:12:29,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:29,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:29,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:30,583 INFO L124 PetriNetUnfolderBase]: 253/518 cut-off events. [2025-03-04 02:12:30,583 INFO L125 PetriNetUnfolderBase]: For 4309/4309 co-relation queries the response was YES. [2025-03-04 02:12:30,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 518 events. 253/518 cut-off events. For 4309/4309 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2147 event pairs, 51 based on Foata normal form. 1/519 useless extension candidates. Maximal degree in co-relation 2653. Up to 274 conditions per place. [2025-03-04 02:12:30,586 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 64 selfloop transitions, 28 changer transitions 42/135 dead transitions. [2025-03-04 02:12:30,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 135 transitions, 1829 flow [2025-03-04 02:12:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:12:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:12:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 237 transitions. [2025-03-04 02:12:30,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.246875 [2025-03-04 02:12:30,587 INFO L175 Difference]: Start difference. First operand has 142 places, 110 transitions, 1421 flow. Second operand 16 states and 237 transitions. [2025-03-04 02:12:30,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 135 transitions, 1829 flow [2025-03-04 02:12:30,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 135 transitions, 1609 flow, removed 10 selfloop flow, removed 21 redundant places. [2025-03-04 02:12:30,597 INFO L231 Difference]: Finished difference. Result has 127 places, 78 transitions, 885 flow [2025-03-04 02:12:30,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=885, PETRI_PLACES=127, PETRI_TRANSITIONS=78} [2025-03-04 02:12:30,598 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 74 predicate places. [2025-03-04 02:12:30,598 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 78 transitions, 885 flow [2025-03-04 02:12:30,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.785714285714286) internal successors, (358), 28 states have internal predecessors, (358), 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-03-04 02:12:30,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:30,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:30,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:12:30,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 02:12:30,799 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:30,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1652133481, now seen corresponding path program 11 times [2025-03-04 02:12:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321979081] [2025-03-04 02:12:30,799 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:12:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:30,811 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:30,821 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:30,821 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:12:30,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321979081] [2025-03-04 02:12:31,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321979081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:12:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461164750] [2025-03-04 02:12:31,321 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:12:31,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:12:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:12:31,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:12:31,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:12:31,442 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:31,508 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:31,508 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:12:31,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:31,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 02:12:31,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:12:31,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 02:12:31,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-04 02:12:31,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-03-04 02:12:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:31,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:12:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:32,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461164750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:12:32,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:12:32,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2025-03-04 02:12:32,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028636588] [2025-03-04 02:12:32,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:12:32,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 02:12:32,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:32,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 02:12:32,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:12:32,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:32,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 78 transitions, 885 flow. Second operand has 27 states, 27 states have (on average 13.0) internal successors, (351), 27 states have internal predecessors, (351), 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-03-04 02:12:32,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:32,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:32,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:33,062 INFO L124 PetriNetUnfolderBase]: 219/448 cut-off events. [2025-03-04 02:12:33,062 INFO L125 PetriNetUnfolderBase]: For 3209/3209 co-relation queries the response was YES. [2025-03-04 02:12:33,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 448 events. 219/448 cut-off events. For 3209/3209 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1818 event pairs, 32 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 2197. Up to 119 conditions per place. [2025-03-04 02:12:33,064 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 64 selfloop transitions, 28 changer transitions 29/122 dead transitions. [2025-03-04 02:12:33,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 122 transitions, 1435 flow [2025-03-04 02:12:33,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 02:12:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 02:12:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 254 transitions. [2025-03-04 02:12:33,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24901960784313726 [2025-03-04 02:12:33,065 INFO L175 Difference]: Start difference. First operand has 127 places, 78 transitions, 885 flow. Second operand 17 states and 254 transitions. [2025-03-04 02:12:33,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 122 transitions, 1435 flow [2025-03-04 02:12:33,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 1102 flow, removed 9 selfloop flow, removed 33 redundant places. [2025-03-04 02:12:33,072 INFO L231 Difference]: Finished difference. Result has 99 places, 70 transitions, 596 flow [2025-03-04 02:12:33,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=596, PETRI_PLACES=99, PETRI_TRANSITIONS=70} [2025-03-04 02:12:33,072 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2025-03-04 02:12:33,072 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 70 transitions, 596 flow [2025-03-04 02:12:33,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.0) internal successors, (351), 27 states have internal predecessors, (351), 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-03-04 02:12:33,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:33,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:33,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:12:33,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:12:33,273 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:33,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:33,274 INFO L85 PathProgramCache]: Analyzing trace with hash -122880901, now seen corresponding path program 12 times [2025-03-04 02:12:33,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:33,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568847900] [2025-03-04 02:12:33,274 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:12:33,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:33,286 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:33,291 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:33,291 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:12:33,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568847900] [2025-03-04 02:12:33,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568847900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:12:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458030178] [2025-03-04 02:12:33,708 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:12:33,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:12:33,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:12:33,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:12:33,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:12:33,888 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-04 02:12:33,931 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:33,932 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 02:12:33,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:33,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 02:12:33,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:12:33,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 02:12:34,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2025-03-04 02:12:34,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-03-04 02:12:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:34,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:12:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:34,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458030178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:12:34,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:12:34,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 27 [2025-03-04 02:12:34,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146782265] [2025-03-04 02:12:34,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:12:34,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 02:12:34,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:34,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 02:12:34,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2025-03-04 02:12:34,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:34,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 70 transitions, 596 flow. Second operand has 27 states, 27 states have (on average 13.037037037037036) internal successors, (352), 27 states have internal predecessors, (352), 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-03-04 02:12:34,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:34,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:34,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:35,419 INFO L124 PetriNetUnfolderBase]: 193/404 cut-off events. [2025-03-04 02:12:35,419 INFO L125 PetriNetUnfolderBase]: For 1205/1205 co-relation queries the response was YES. [2025-03-04 02:12:35,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 404 events. 193/404 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1625 event pairs, 49 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 1662. Up to 194 conditions per place. [2025-03-04 02:12:35,421 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 43 selfloop transitions, 13 changer transitions 47/104 dead transitions. [2025-03-04 02:12:35,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 104 transitions, 990 flow [2025-03-04 02:12:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:12:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:12:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 232 transitions. [2025-03-04 02:12:35,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24166666666666667 [2025-03-04 02:12:35,421 INFO L175 Difference]: Start difference. First operand has 99 places, 70 transitions, 596 flow. Second operand 16 states and 232 transitions. [2025-03-04 02:12:35,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 104 transitions, 990 flow [2025-03-04 02:12:35,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 104 transitions, 877 flow, removed 3 selfloop flow, removed 17 redundant places. [2025-03-04 02:12:35,425 INFO L231 Difference]: Finished difference. Result has 91 places, 53 transitions, 352 flow [2025-03-04 02:12:35,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=352, PETRI_PLACES=91, PETRI_TRANSITIONS=53} [2025-03-04 02:12:35,425 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2025-03-04 02:12:35,425 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 53 transitions, 352 flow [2025-03-04 02:12:35,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.037037037037036) internal successors, (352), 27 states have internal predecessors, (352), 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-03-04 02:12:35,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:12:35,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:12:35,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:12:35,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:12:35,626 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-04 02:12:35,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:12:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash 881023335, now seen corresponding path program 13 times [2025-03-04 02:12:35,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:12:35,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988762571] [2025-03-04 02:12:35,627 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:12:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:12:35,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:35,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:35,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:35,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:36,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:12:36,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988762571] [2025-03-04 02:12:36,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988762571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:12:36,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697742648] [2025-03-04 02:12:36,220 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:12:36,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:12:36,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:12:36,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:12:36,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:12:36,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:12:36,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:12:36,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:12:36,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:12:36,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-04 02:12:36,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:12:36,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-04 02:12:36,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2025-03-04 02:12:36,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-03-04 02:12:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:36,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:12:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:12:37,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697742648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:12:37,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:12:37,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2025-03-04 02:12:37,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660289093] [2025-03-04 02:12:37,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:12:37,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 02:12:37,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:12:37,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 02:12:37,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2025-03-04 02:12:37,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-04 02:12:37,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 53 transitions, 352 flow. Second operand has 29 states, 29 states have (on average 12.689655172413794) internal successors, (368), 29 states have internal predecessors, (368), 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-03-04 02:12:37,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:12:37,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-04 02:12:37,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:12:37,713 INFO L124 PetriNetUnfolderBase]: 104/219 cut-off events. [2025-03-04 02:12:37,713 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2025-03-04 02:12:37,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 219 events. 104/219 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 669 event pairs, 4 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 808. Up to 84 conditions per place. [2025-03-04 02:12:37,714 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 0 selfloop transitions, 0 changer transitions 65/65 dead transitions. [2025-03-04 02:12:37,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 65 transitions, 505 flow [2025-03-04 02:12:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 02:12:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 02:12:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 192 transitions. [2025-03-04 02:12:37,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22857142857142856 [2025-03-04 02:12:37,715 INFO L175 Difference]: Start difference. First operand has 91 places, 53 transitions, 352 flow. Second operand 14 states and 192 transitions. [2025-03-04 02:12:37,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 65 transitions, 505 flow [2025-03-04 02:12:37,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 65 transitions, 439 flow, removed 6 selfloop flow, removed 15 redundant places. [2025-03-04 02:12:37,716 INFO L231 Difference]: Finished difference. Result has 77 places, 0 transitions, 0 flow [2025-03-04 02:12:37,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=77, PETRI_TRANSITIONS=0} [2025-03-04 02:12:37,717 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2025-03-04 02:12:37,717 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 0 transitions, 0 flow [2025-03-04 02:12:37,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 12.689655172413794) internal successors, (368), 29 states have internal predecessors, (368), 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-03-04 02:12:37,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-03-04 02:12:37,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-04 02:12:37,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-04 02:12:37,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-04 02:12:37,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-04 02:12:37,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-04 02:12:37,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-03-04 02:12:37,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-03-04 02:12:37,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 02:12:37,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 02:12:37,921 INFO L422 BasicCegarLoop]: Path program histogram: [13, 9, 1, 1, 1, 1] [2025-03-04 02:12:37,923 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:12:37,923 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:12:37,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:12:37 BasicIcfg [2025-03-04 02:12:37,927 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:12:37,928 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:12:37,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:12:37,928 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:12:37,929 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:12:05" (3/4) ... [2025-03-04 02:12:37,931 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:12:37,933 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-04 02:12:37,937 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 87 nodes and edges [2025-03-04 02:12:37,938 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-03-04 02:12:37,938 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-04 02:12:37,938 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 02:12:37,997 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:12:37,998 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:12:37,998 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:12:37,998 INFO L158 Benchmark]: Toolchain (without parser) took 33389.97ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 101.5MB in the beginning and 37.9MB in the end (delta: 63.5MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2025-03-04 02:12:37,998 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:37,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.19ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 70.8MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 02:12:37,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.54ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 68.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:12:37,999 INFO L158 Benchmark]: Boogie Preprocessor took 61.78ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 65.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:12:37,999 INFO L158 Benchmark]: IcfgBuilder took 614.55ms. Allocated memory is still 142.6MB. Free memory was 65.7MB in the beginning and 94.8MB in the end (delta: -29.1MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2025-03-04 02:12:37,999 INFO L158 Benchmark]: TraceAbstraction took 32230.13ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 94.1MB in the beginning and 45.6MB in the end (delta: 48.5MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2025-03-04 02:12:37,999 INFO L158 Benchmark]: Witness Printer took 69.95ms. Allocated memory is still 167.8MB. Free memory was 45.6MB in the beginning and 37.9MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:12:38,000 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.34ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.19ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 70.8MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.54ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 68.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.78ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 65.7MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 614.55ms. Allocated memory is still 142.6MB. Free memory was 65.7MB in the beginning and 94.8MB in the end (delta: -29.1MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * TraceAbstraction took 32230.13ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 94.1MB in the beginning and 45.6MB in the end (delta: 48.5MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. * Witness Printer took 69.95ms. Allocated memory is still 167.8MB. Free memory was 45.6MB in the beginning and 37.9MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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, 60 locations, 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: 32.1s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3137 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3008 mSDsluCounter, 3983 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3895 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11217 IncrementalHoareTripleChecker+Invalid, 11534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 88 mSDtfsCounter, 11217 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 772 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2291 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3489occurred in iteration=14, InterpolantAutomatonStates: 330, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 864 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 983 ConstructedInterpolants, 90 QuantifiedInterpolants, 15555 SizeOfPredicates, 143 NumberOfNonLiveVariables, 1600 ConjunctsInSsa, 325 ConjunctsInUnsatCore, 36 InterpolantComputations, 21 PerfectInterpolantSequences, 1/16 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-03-04 02:12:38,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE