./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 17:22:59,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:22:59,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:22:59,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:22:59,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:22:59,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:22:59,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:22:59,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:22:59,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:22:59,572 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:22:59,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:22:59,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:22:59,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:22:59,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:22:59,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:22:59,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:22:59,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:22:59,574 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-08 17:22:59,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:22:59,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:22:59,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:22:59,778 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:22:59,779 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:22:59,779 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-08 17:23:00,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4404e569/68191cb5830c4a01ae737d98ae197caa/FLAGec55d35f2 [2025-03-08 17:23:01,260 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:23:01,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2025-03-08 17:23:01,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4404e569/68191cb5830c4a01ae737d98ae197caa/FLAGec55d35f2 [2025-03-08 17:23:01,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4404e569/68191cb5830c4a01ae737d98ae197caa [2025-03-08 17:23:01,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:23:01,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:23:01,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:23:01,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:23:01,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:23:01,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e950db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01, skipping insertion in model container [2025-03-08 17:23:01,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:23:01,782 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-08 17:23:01,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:23:01,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:23:01,848 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-08 17:23:01,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:23:01,886 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:23:01,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01 WrapperNode [2025-03-08 17:23:01,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:23:01,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:23:01,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:23:01,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:23:01,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,922 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 126 [2025-03-08 17:23:01,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:23:01,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:23:01,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:23:01,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:23:01,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,949 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 2, 13]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2025-03-08 17:23:01,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:23:01,978 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:23:01,978 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:23:01,978 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:23:01,979 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (1/1) ... [2025-03-08 17:23:01,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:23:01,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:23:02,005 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-08 17:23:02,008 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-08 17:23:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-08 17:23:02,026 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:23:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:23:02,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:23:02,027 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:23:02,216 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:23:02,218 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:23:02,427 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:23:02,427 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:23:02,573 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:23:02,574 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:23:02,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:23:02 BoogieIcfgContainer [2025-03-08 17:23:02,574 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:23:02,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:23:02,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:23:02,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:23:02,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:23:01" (1/3) ... [2025-03-08 17:23:02,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7de52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:23:02, skipping insertion in model container [2025-03-08 17:23:02,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:23:01" (2/3) ... [2025-03-08 17:23:02,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7de52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:23:02, skipping insertion in model container [2025-03-08 17:23:02,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:23:02" (3/3) ... [2025-03-08 17:23:02,581 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2025-03-08 17:23:02,591 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:23:02,592 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-08 17:23:02,592 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:23:02,632 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:23:02,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2025-03-08 17:23:02,690 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2025-03-08 17:23:02,694 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:23:02,696 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-08 17:23:02,697 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2025-03-08 17:23:02,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2025-03-08 17:23:02,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:23:02,720 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;@265c4e81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:23:02,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-08 17:23:02,723 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:23:02,723 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-08 17:23:02,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:23:02,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:02,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-08 17:23:02,725 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-08 17:23:02,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:02,729 INFO L85 PathProgramCache]: Analyzing trace with hash 11330651, now seen corresponding path program 1 times [2025-03-08 17:23:02,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:02,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414682331] [2025-03-08 17:23:02,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:02,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:02,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-08 17:23:02,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-08 17:23:02,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:02,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:03,151 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-08 17:23:03,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:03,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414682331] [2025-03-08 17:23:03,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414682331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:03,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:03,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:23:03,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399785078] [2025-03-08 17:23:03,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:03,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:23:03,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:03,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:23:03,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:23:03,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:03,198 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-08 17:23:03,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:03,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:03,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:03,445 INFO L124 PetriNetUnfolderBase]: 466/828 cut-off events. [2025-03-08 17:23:03,445 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-08 17:23:03,447 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-08 17:23:03,451 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2025-03-08 17:23:03,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2025-03-08 17:23:03,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:23:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:23:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-08 17:23:03,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-08 17:23:03,463 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2025-03-08 17:23:03,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2025-03-08 17:23:03,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 17:23:03,472 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2025-03-08 17:23:03,474 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-08 17:23:03,477 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2025-03-08 17:23:03,478 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2025-03-08 17:23:03,478 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-08 17:23:03,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:03,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 17:23:03,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:23:03,480 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-08 17:23:03,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1996087732, now seen corresponding path program 1 times [2025-03-08 17:23:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:03,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901004184] [2025-03-08 17:23:03,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:03,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 17:23:03,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 17:23:03,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:03,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:03,665 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-08 17:23:03,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:03,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901004184] [2025-03-08 17:23:03,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901004184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:03,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:03,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:23:03,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093172280] [2025-03-08 17:23:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:03,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:23:03,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:03,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:23:03,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:23:03,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:03,686 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-08 17:23:03,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:03,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:03,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:03,872 INFO L124 PetriNetUnfolderBase]: 466/821 cut-off events. [2025-03-08 17:23:03,873 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-08 17:23:03,876 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-08 17:23:03,879 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 47 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2025-03-08 17:23:03,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 265 flow [2025-03-08 17:23:03,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:23:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:23:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-08 17:23:03,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-03-08 17:23:03,882 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 109 transitions. [2025-03-08 17:23:03,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 265 flow [2025-03-08 17:23:03,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:23:03,886 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2025-03-08 17:23:03,886 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-08 17:23:03,887 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-03-08 17:23:03,887 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2025-03-08 17:23:03,887 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-08 17:23:03,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:03,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:23:03,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:23:03,887 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-08 17:23:03,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1937579247, now seen corresponding path program 1 times [2025-03-08 17:23:03,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:03,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280247947] [2025-03-08 17:23:03,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:03,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:03,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 17:23:03,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 17:23:03,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:03,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:04,048 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-08 17:23:04,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:04,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280247947] [2025-03-08 17:23:04,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280247947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:04,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:04,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:23:04,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323983964] [2025-03-08 17:23:04,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:04,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:23:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:04,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:23:04,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:23:04,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:04,068 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-08 17:23:04,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:04,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:04,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:04,286 INFO L124 PetriNetUnfolderBase]: 562/1029 cut-off events. [2025-03-08 17:23:04,287 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-03-08 17:23:04,288 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-08 17:23:04,293 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 49 selfloop transitions, 10 changer transitions 4/67 dead transitions. [2025-03-08 17:23:04,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2025-03-08 17:23:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:23:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:23:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-03-08 17:23:04,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-08 17:23:04,296 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2025-03-08 17:23:04,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2025-03-08 17:23:04,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 17:23:04,299 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 150 flow [2025-03-08 17:23:04,300 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-08 17:23:04,301 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-03-08 17:23:04,301 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 150 flow [2025-03-08 17:23:04,301 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-08 17:23:04,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:04,301 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-08 17:23:04,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:23:04,302 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-08 17:23:04,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:04,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2131125183, now seen corresponding path program 1 times [2025-03-08 17:23:04,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:04,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990358538] [2025-03-08 17:23:04,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:04,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:04,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 17:23:04,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 17:23:04,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:04,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:04,400 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-08 17:23:04,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:04,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990358538] [2025-03-08 17:23:04,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990358538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:04,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:04,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:23:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860766170] [2025-03-08 17:23:04,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:04,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:23:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:04,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:23:04,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:23:04,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-08 17:23:04,403 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-08 17:23:04,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:04,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-08 17:23:04,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:04,542 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2025-03-08 17:23:04,542 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-03-08 17:23:04,543 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-08 17:23:04,545 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-08 17:23:04,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 278 flow [2025-03-08 17:23:04,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:23:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:23:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-03-08 17:23:04,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2025-03-08 17:23:04,547 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 150 flow. Second operand 4 states and 131 transitions. [2025-03-08 17:23:04,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 278 flow [2025-03-08 17:23:04,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 248 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-08 17:23:04,549 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 96 flow [2025-03-08 17:23:04,549 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-08 17:23:04,549 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2025-03-08 17:23:04,549 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 96 flow [2025-03-08 17:23:04,551 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-08 17:23:04,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:04,551 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-08 17:23:04,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:23:04,551 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-08 17:23:04,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:04,553 INFO L85 PathProgramCache]: Analyzing trace with hash -889048815, now seen corresponding path program 1 times [2025-03-08 17:23:04,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:04,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729103140] [2025-03-08 17:23:04,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:04,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:04,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:23:04,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:23:04,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:04,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:05,002 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-08 17:23:05,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:05,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729103140] [2025-03-08 17:23:05,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729103140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:05,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:05,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:23:05,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642191761] [2025-03-08 17:23:05,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:05,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:23:05,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:05,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:23:05,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:23:05,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:05,028 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-08 17:23:05,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:05,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:05,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:05,365 INFO L124 PetriNetUnfolderBase]: 268/499 cut-off events. [2025-03-08 17:23:05,365 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-03-08 17:23:05,366 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-08 17:23:05,368 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 67 selfloop transitions, 21 changer transitions 0/90 dead transitions. [2025-03-08 17:23:05,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 411 flow [2025-03-08 17:23:05,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:23:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 17:23:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 206 transitions. [2025-03-08 17:23:05,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2861111111111111 [2025-03-08 17:23:05,371 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 96 flow. Second operand 12 states and 206 transitions. [2025-03-08 17:23:05,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 411 flow [2025-03-08 17:23:05,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:23:05,374 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 197 flow [2025-03-08 17:23:05,375 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-08 17:23:05,375 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2025-03-08 17:23:05,375 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 197 flow [2025-03-08 17:23:05,375 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-08 17:23:05,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:05,375 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-08 17:23:05,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:23:05,376 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-08 17:23:05,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1008231267, now seen corresponding path program 2 times [2025-03-08 17:23:05,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:05,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153820759] [2025-03-08 17:23:05,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:23:05,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:05,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:23:05,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:23:05,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:23:05,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:05,929 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-08 17:23:05,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:05,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153820759] [2025-03-08 17:23:05,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153820759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:05,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:05,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:23:05,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485004941] [2025-03-08 17:23:05,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:05,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:23:05,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:05,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:23:05,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:23:05,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-08 17:23:05,931 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-08 17:23:05,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:05,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-08 17:23:05,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:06,281 INFO L124 PetriNetUnfolderBase]: 300/555 cut-off events. [2025-03-08 17:23:06,281 INFO L125 PetriNetUnfolderBase]: For 511/511 co-relation queries the response was YES. [2025-03-08 17:23:06,282 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-08 17:23:06,287 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 60 selfloop transitions, 30 changer transitions 0/98 dead transitions. [2025-03-08 17:23:06,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 601 flow [2025-03-08 17:23:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:23:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 17:23:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 294 transitions. [2025-03-08 17:23:06,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-03-08 17:23:06,290 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 197 flow. Second operand 10 states and 294 transitions. [2025-03-08 17:23:06,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 601 flow [2025-03-08 17:23:06,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 569 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-08 17:23:06,296 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 418 flow [2025-03-08 17:23:06,296 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-08 17:23:06,297 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2025-03-08 17:23:06,297 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 418 flow [2025-03-08 17:23:06,297 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-08 17:23:06,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:06,298 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-08 17:23:06,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:23:06,298 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-08 17:23:06,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:06,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2073951171, now seen corresponding path program 3 times [2025-03-08 17:23:06,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:06,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909307551] [2025-03-08 17:23:06,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:23:06,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:06,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:23:06,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:23:06,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:23:06,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:06,884 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-08 17:23:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909307551] [2025-03-08 17:23:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909307551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:06,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:06,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:23:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118673845] [2025-03-08 17:23:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:06,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:23:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:06,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:23:06,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:23:06,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:06,914 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-08 17:23:06,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:06,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:06,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:07,622 INFO L124 PetriNetUnfolderBase]: 389/724 cut-off events. [2025-03-08 17:23:07,623 INFO L125 PetriNetUnfolderBase]: For 910/910 co-relation queries the response was YES. [2025-03-08 17:23:07,624 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-08 17:23:07,628 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 93 selfloop transitions, 45 changer transitions 0/140 dead transitions. [2025-03-08 17:23:07,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 140 transitions, 984 flow [2025-03-08 17:23:07,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 17:23:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-08 17:23:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 268 transitions. [2025-03-08 17:23:07,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2791666666666667 [2025-03-08 17:23:07,630 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 418 flow. Second operand 16 states and 268 transitions. [2025-03-08 17:23:07,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 140 transitions, 984 flow [2025-03-08 17:23:07,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 140 transitions, 982 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:23:07,637 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 634 flow [2025-03-08 17:23:07,637 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-08 17:23:07,637 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2025-03-08 17:23:07,638 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 634 flow [2025-03-08 17:23:07,638 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-08 17:23:07,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:07,638 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-08 17:23:07,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:23:07,638 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-08 17:23:07,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:07,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1869156349, now seen corresponding path program 4 times [2025-03-08 17:23:07,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:07,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618250466] [2025-03-08 17:23:07,639 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:23:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:07,667 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-08 17:23:07,685 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:23:07,685 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:23:07,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:08,022 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-08 17:23:08,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:08,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618250466] [2025-03-08 17:23:08,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618250466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:08,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:08,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:23:08,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100757158] [2025-03-08 17:23:08,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:08,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:23:08,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:08,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:23:08,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:23:08,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-08 17:23:08,024 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-08 17:23:08,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:08,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-08 17:23:08,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:08,435 INFO L124 PetriNetUnfolderBase]: 634/1181 cut-off events. [2025-03-08 17:23:08,435 INFO L125 PetriNetUnfolderBase]: For 3189/3189 co-relation queries the response was YES. [2025-03-08 17:23:08,438 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-08 17:23:08,443 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 102 selfloop transitions, 49 changer transitions 0/160 dead transitions. [2025-03-08 17:23:08,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 160 transitions, 1462 flow [2025-03-08 17:23:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:23:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:23:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 339 transitions. [2025-03-08 17:23:08,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2025-03-08 17:23:08,445 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 634 flow. Second operand 11 states and 339 transitions. [2025-03-08 17:23:08,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 160 transitions, 1462 flow [2025-03-08 17:23:08,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 160 transitions, 1405 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-08 17:23:08,476 INFO L231 Difference]: Finished difference. Result has 95 places, 104 transitions, 999 flow [2025-03-08 17:23:08,477 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-08 17:23:08,477 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2025-03-08 17:23:08,478 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 104 transitions, 999 flow [2025-03-08 17:23:08,478 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-08 17:23:08,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:08,478 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-08 17:23:08,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:23:08,478 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-08 17:23:08,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash -564419071, now seen corresponding path program 5 times [2025-03-08 17:23:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:08,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068681146] [2025-03-08 17:23:08,479 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:23:08,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:08,495 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:23:08,503 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:23:08,503 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:23:08,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:08,807 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-08 17:23:08,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:08,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068681146] [2025-03-08 17:23:08,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068681146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:08,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:08,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:23:08,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076752066] [2025-03-08 17:23:08,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:08,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:23:08,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:08,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:23:08,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:23:08,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-08 17:23:08,809 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-08 17:23:08,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:08,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-08 17:23:08,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:09,212 INFO L124 PetriNetUnfolderBase]: 646/1215 cut-off events. [2025-03-08 17:23:09,212 INFO L125 PetriNetUnfolderBase]: For 5344/5344 co-relation queries the response was YES. [2025-03-08 17:23:09,216 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-08 17:23:09,221 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 93 selfloop transitions, 78 changer transitions 0/180 dead transitions. [2025-03-08 17:23:09,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 180 transitions, 2010 flow [2025-03-08 17:23:09,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:23:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 17:23:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 348 transitions. [2025-03-08 17:23:09,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-08 17:23:09,223 INFO L175 Difference]: Start difference. First operand has 95 places, 104 transitions, 999 flow. Second operand 12 states and 348 transitions. [2025-03-08 17:23:09,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 180 transitions, 2010 flow [2025-03-08 17:23:09,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 180 transitions, 1947 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-08 17:23:09,240 INFO L231 Difference]: Finished difference. Result has 107 places, 135 transitions, 1580 flow [2025-03-08 17:23:09,241 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-08 17:23:09,241 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2025-03-08 17:23:09,241 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 135 transitions, 1580 flow [2025-03-08 17:23:09,241 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-08 17:23:09,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:09,242 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-08 17:23:09,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:23:09,242 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-08 17:23:09,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:09,242 INFO L85 PathProgramCache]: Analyzing trace with hash 476794071, now seen corresponding path program 6 times [2025-03-08 17:23:09,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:09,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885759434] [2025-03-08 17:23:09,243 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:23:09,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:09,258 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:23:09,266 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:23:09,267 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:23:09,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:09,767 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-08 17:23:09,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:09,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885759434] [2025-03-08 17:23:09,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885759434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:09,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:09,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:23:09,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793251263] [2025-03-08 17:23:09,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:09,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:23:09,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:09,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:23:09,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:23:09,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:09,791 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-08 17:23:09,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:09,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:09,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:10,633 INFO L124 PetriNetUnfolderBase]: 646/1213 cut-off events. [2025-03-08 17:23:10,633 INFO L125 PetriNetUnfolderBase]: For 7055/7055 co-relation queries the response was YES. [2025-03-08 17:23:10,637 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-08 17:23:10,642 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 135 selfloop transitions, 85 changer transitions 0/222 dead transitions. [2025-03-08 17:23:10,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 222 transitions, 2584 flow [2025-03-08 17:23:10,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 17:23:10,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-08 17:23:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 293 transitions. [2025-03-08 17:23:10,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2872549019607843 [2025-03-08 17:23:10,644 INFO L175 Difference]: Start difference. First operand has 107 places, 135 transitions, 1580 flow. Second operand 17 states and 293 transitions. [2025-03-08 17:23:10,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 222 transitions, 2584 flow [2025-03-08 17:23:10,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 222 transitions, 2487 flow, removed 28 selfloop flow, removed 5 redundant places. [2025-03-08 17:23:10,702 INFO L231 Difference]: Finished difference. Result has 127 places, 150 transitions, 1979 flow [2025-03-08 17:23:10,702 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-08 17:23:10,703 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 74 predicate places. [2025-03-08 17:23:10,704 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 150 transitions, 1979 flow [2025-03-08 17:23:10,704 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-08 17:23:10,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:10,705 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-08 17:23:10,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:23:10,705 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-08 17:23:10,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1456827013, now seen corresponding path program 7 times [2025-03-08 17:23:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:10,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891372424] [2025-03-08 17:23:10,706 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:23:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:10,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:23:10,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:23:10,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:10,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:11,185 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-08 17:23:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:11,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891372424] [2025-03-08 17:23:11,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891372424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:11,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:11,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:23:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665122675] [2025-03-08 17:23:11,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:11,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:23:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:11,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:23:11,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:23:11,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:11,229 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-08 17:23:11,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:11,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:11,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:12,180 INFO L124 PetriNetUnfolderBase]: 868/1627 cut-off events. [2025-03-08 17:23:12,180 INFO L125 PetriNetUnfolderBase]: For 11619/11619 co-relation queries the response was YES. [2025-03-08 17:23:12,187 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-08 17:23:12,194 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 145 selfloop transitions, 118 changer transitions 0/265 dead transitions. [2025-03-08 17:23:12,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 265 transitions, 3495 flow [2025-03-08 17:23:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 17:23:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 17:23:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 305 transitions. [2025-03-08 17:23:12,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2824074074074074 [2025-03-08 17:23:12,197 INFO L175 Difference]: Start difference. First operand has 127 places, 150 transitions, 1979 flow. Second operand 18 states and 305 transitions. [2025-03-08 17:23:12,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 265 transitions, 3495 flow [2025-03-08 17:23:12,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 265 transitions, 3399 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-08 17:23:12,252 INFO L231 Difference]: Finished difference. Result has 145 places, 177 transitions, 2737 flow [2025-03-08 17:23:12,252 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-08 17:23:12,253 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 92 predicate places. [2025-03-08 17:23:12,253 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 177 transitions, 2737 flow [2025-03-08 17:23:12,254 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-08 17:23:12,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:12,254 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-08 17:23:12,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:23:12,254 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-08 17:23:12,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash 753717213, now seen corresponding path program 8 times [2025-03-08 17:23:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:12,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543319004] [2025-03-08 17:23:12,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:23:12,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:12,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:23:12,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:23:12,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:23:12,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:12,543 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-08 17:23:12,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:12,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543319004] [2025-03-08 17:23:12,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543319004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:12,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:12,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:23:12,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347026711] [2025-03-08 17:23:12,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:12,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:23:12,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:12,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:23:12,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:23:12,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-08 17:23:12,544 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-08 17:23:12,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:12,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-08 17:23:12,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:13,033 INFO L124 PetriNetUnfolderBase]: 890/1673 cut-off events. [2025-03-08 17:23:13,033 INFO L125 PetriNetUnfolderBase]: For 15665/15665 co-relation queries the response was YES. [2025-03-08 17:23:13,040 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-08 17:23:13,048 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 127 selfloop transitions, 97 changer transitions 0/236 dead transitions. [2025-03-08 17:23:13,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 236 transitions, 3694 flow [2025-03-08 17:23:13,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:23:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 17:23:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 357 transitions. [2025-03-08 17:23:13,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49583333333333335 [2025-03-08 17:23:13,049 INFO L175 Difference]: Start difference. First operand has 145 places, 177 transitions, 2737 flow. Second operand 12 states and 357 transitions. [2025-03-08 17:23:13,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 236 transitions, 3694 flow [2025-03-08 17:23:13,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 236 transitions, 3604 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-08 17:23:13,137 INFO L231 Difference]: Finished difference. Result has 155 places, 188 transitions, 3138 flow [2025-03-08 17:23:13,138 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-08 17:23:13,138 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 102 predicate places. [2025-03-08 17:23:13,140 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 188 transitions, 3138 flow [2025-03-08 17:23:13,140 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-08 17:23:13,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:13,140 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-08 17:23:13,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:23:13,140 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-08 17:23:13,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:13,141 INFO L85 PathProgramCache]: Analyzing trace with hash -323835375, now seen corresponding path program 9 times [2025-03-08 17:23:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:13,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061807868] [2025-03-08 17:23:13,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:23:13,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:13,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:23:13,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:23:13,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:23:13,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:13,605 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-08 17:23:13,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:13,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061807868] [2025-03-08 17:23:13,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061807868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:13,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:13,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:23:13,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125918644] [2025-03-08 17:23:13,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:13,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:23:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:13,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:23:13,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:23:13,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:13,632 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-08 17:23:13,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:13,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:13,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:14,623 INFO L124 PetriNetUnfolderBase]: 890/1671 cut-off events. [2025-03-08 17:23:14,623 INFO L125 PetriNetUnfolderBase]: For 18052/18052 co-relation queries the response was YES. [2025-03-08 17:23:14,630 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-08 17:23:14,641 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 162 selfloop transitions, 114 changer transitions 0/277 dead transitions. [2025-03-08 17:23:14,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 277 transitions, 4352 flow [2025-03-08 17:23:14,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 17:23:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-08 17:23:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 321 transitions. [2025-03-08 17:23:14,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28157894736842104 [2025-03-08 17:23:14,645 INFO L175 Difference]: Start difference. First operand has 155 places, 188 transitions, 3138 flow. Second operand 19 states and 321 transitions. [2025-03-08 17:23:14,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 277 transitions, 4352 flow [2025-03-08 17:23:14,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 277 transitions, 4158 flow, removed 44 selfloop flow, removed 8 redundant places. [2025-03-08 17:23:14,713 INFO L231 Difference]: Finished difference. Result has 167 places, 194 transitions, 3476 flow [2025-03-08 17:23:14,713 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-08 17:23:14,714 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 114 predicate places. [2025-03-08 17:23:14,714 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 194 transitions, 3476 flow [2025-03-08 17:23:14,714 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-08 17:23:14,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:14,714 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-08 17:23:14,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:23:14,714 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-08 17:23:14,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1999889587, now seen corresponding path program 1 times [2025-03-08 17:23:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471763571] [2025-03-08 17:23:14,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:23:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:14,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:23:14,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:14,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:14,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:15,261 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-08 17:23:15,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:15,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471763571] [2025-03-08 17:23:15,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471763571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:15,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:15,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:23:15,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233619509] [2025-03-08 17:23:15,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:15,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:23:15,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:15,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:23:15,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:23:15,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:15,290 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-08 17:23:15,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:15,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:15,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:15,911 INFO L124 PetriNetUnfolderBase]: 962/1815 cut-off events. [2025-03-08 17:23:15,911 INFO L125 PetriNetUnfolderBase]: For 22283/22283 co-relation queries the response was YES. [2025-03-08 17:23:15,918 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-08 17:23:15,923 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 137 selfloop transitions, 73 changer transitions 47/258 dead transitions. [2025-03-08 17:23:15,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 258 transitions, 4638 flow [2025-03-08 17:23:15,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 17:23:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-08 17:23:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 231 transitions. [2025-03-08 17:23:15,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.275 [2025-03-08 17:23:15,925 INFO L175 Difference]: Start difference. First operand has 167 places, 194 transitions, 3476 flow. Second operand 14 states and 231 transitions. [2025-03-08 17:23:15,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 258 transitions, 4638 flow [2025-03-08 17:23:15,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 258 transitions, 4449 flow, removed 18 selfloop flow, removed 11 redundant places. [2025-03-08 17:23:15,997 INFO L231 Difference]: Finished difference. Result has 174 places, 193 transitions, 3489 flow [2025-03-08 17:23:15,997 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-08 17:23:15,997 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 121 predicate places. [2025-03-08 17:23:15,998 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 193 transitions, 3489 flow [2025-03-08 17:23:15,998 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-08 17:23:15,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:15,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:23:15,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:23:15,998 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-08 17:23:15,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2132970693, now seen corresponding path program 2 times [2025-03-08 17:23:15,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:15,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341409811] [2025-03-08 17:23:15,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:23:15,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:16,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:23:16,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:16,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:23:16,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:16,533 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-08 17:23:16,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:16,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341409811] [2025-03-08 17:23:16,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341409811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:16,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:16,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:23:16,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550102516] [2025-03-08 17:23:16,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:16,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:23:16,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:16,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:23:16,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:23:16,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:16,558 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-08 17:23:16,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:16,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:16,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:17,221 INFO L124 PetriNetUnfolderBase]: 941/1780 cut-off events. [2025-03-08 17:23:17,222 INFO L125 PetriNetUnfolderBase]: For 20951/20951 co-relation queries the response was YES. [2025-03-08 17:23:17,229 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-08 17:23:17,233 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 163 selfloop transitions, 57 changer transitions 53/274 dead transitions. [2025-03-08 17:23:17,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 274 transitions, 4909 flow [2025-03-08 17:23:17,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 17:23:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-08 17:23:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 233 transitions. [2025-03-08 17:23:17,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2773809523809524 [2025-03-08 17:23:17,235 INFO L175 Difference]: Start difference. First operand has 174 places, 193 transitions, 3489 flow. Second operand 14 states and 233 transitions. [2025-03-08 17:23:17,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 274 transitions, 4909 flow [2025-03-08 17:23:17,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 274 transitions, 4651 flow, removed 44 selfloop flow, removed 12 redundant places. [2025-03-08 17:23:17,299 INFO L231 Difference]: Finished difference. Result has 174 places, 194 transitions, 3377 flow [2025-03-08 17:23:17,300 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-08 17:23:17,300 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 121 predicate places. [2025-03-08 17:23:17,300 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 194 transitions, 3377 flow [2025-03-08 17:23:17,300 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-08 17:23:17,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:17,300 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-08 17:23:17,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:23:17,301 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-08 17:23:17,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash 987557807, now seen corresponding path program 3 times [2025-03-08 17:23:17,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:17,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490961969] [2025-03-08 17:23:17,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:23:17,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:17,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:23:17,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:17,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:23:17,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:17,773 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-08 17:23:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:17,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490961969] [2025-03-08 17:23:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490961969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:17,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:17,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 17:23:17,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015355258] [2025-03-08 17:23:17,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:17,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 17:23:17,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:17,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 17:23:17,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:23:17,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:17,798 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-08 17:23:17,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:17,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:17,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:18,294 INFO L124 PetriNetUnfolderBase]: 808/1535 cut-off events. [2025-03-08 17:23:18,295 INFO L125 PetriNetUnfolderBase]: For 17571/17571 co-relation queries the response was YES. [2025-03-08 17:23:18,300 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-08 17:23:18,305 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 132 selfloop transitions, 46 changer transitions 56/235 dead transitions. [2025-03-08 17:23:18,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 235 transitions, 4113 flow [2025-03-08 17:23:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 17:23:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 17:23:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 219 transitions. [2025-03-08 17:23:18,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28076923076923077 [2025-03-08 17:23:18,306 INFO L175 Difference]: Start difference. First operand has 174 places, 194 transitions, 3377 flow. Second operand 13 states and 219 transitions. [2025-03-08 17:23:18,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 235 transitions, 4113 flow [2025-03-08 17:23:18,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 235 transitions, 3922 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-03-08 17:23:18,360 INFO L231 Difference]: Finished difference. Result has 175 places, 165 transitions, 2831 flow [2025-03-08 17:23:18,360 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-08 17:23:18,361 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 122 predicate places. [2025-03-08 17:23:18,361 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 165 transitions, 2831 flow [2025-03-08 17:23:18,361 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-08 17:23:18,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:18,361 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-08 17:23:18,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 17:23:18,361 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-08 17:23:18,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1072325331, now seen corresponding path program 4 times [2025-03-08 17:23:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:18,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129283581] [2025-03-08 17:23:18,362 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:23:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:18,374 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:23:18,382 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:18,383 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:23:18,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:18,647 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-08 17:23:18,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129283581] [2025-03-08 17:23:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129283581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:18,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:23:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658525741] [2025-03-08 17:23:18,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:18,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:23:18,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:18,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:23:18,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:23:18,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-08 17:23:18,649 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-08 17:23:18,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:18,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-08 17:23:18,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:18,950 INFO L124 PetriNetUnfolderBase]: 654/1255 cut-off events. [2025-03-08 17:23:18,951 INFO L125 PetriNetUnfolderBase]: For 13170/13170 co-relation queries the response was YES. [2025-03-08 17:23:18,955 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-08 17:23:18,959 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 98 selfloop transitions, 75 changer transitions 3/186 dead transitions. [2025-03-08 17:23:18,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 186 transitions, 3158 flow [2025-03-08 17:23:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 17:23:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 17:23:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 327 transitions. [2025-03-08 17:23:18,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954545454545455 [2025-03-08 17:23:18,960 INFO L175 Difference]: Start difference. First operand has 175 places, 165 transitions, 2831 flow. Second operand 11 states and 327 transitions. [2025-03-08 17:23:18,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 186 transitions, 3158 flow [2025-03-08 17:23:19,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 186 transitions, 2919 flow, removed 23 selfloop flow, removed 26 redundant places. [2025-03-08 17:23:19,003 INFO L231 Difference]: Finished difference. Result has 152 places, 161 transitions, 2664 flow [2025-03-08 17:23:19,003 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-08 17:23:19,004 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 99 predicate places. [2025-03-08 17:23:19,004 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 161 transitions, 2664 flow [2025-03-08 17:23:19,004 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-08 17:23:19,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:19,004 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-08 17:23:19,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 17:23:19,004 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-08 17:23:19,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1637876969, now seen corresponding path program 5 times [2025-03-08 17:23:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:19,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798155137] [2025-03-08 17:23:19,005 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:23:19,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:19,017 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:23:19,031 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:19,032 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:23:19,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:19,497 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-08 17:23:19,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:19,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798155137] [2025-03-08 17:23:19,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798155137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:19,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:19,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:23:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017686971] [2025-03-08 17:23:19,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:19,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:23:19,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:19,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:23:19,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:23:19,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:19,536 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-08 17:23:19,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:19,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:19,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:20,097 INFO L124 PetriNetUnfolderBase]: 709/1358 cut-off events. [2025-03-08 17:23:20,097 INFO L125 PetriNetUnfolderBase]: For 14165/14165 co-relation queries the response was YES. [2025-03-08 17:23:20,102 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-08 17:23:20,105 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 116 selfloop transitions, 39 changer transitions 44/200 dead transitions. [2025-03-08 17:23:20,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 200 transitions, 3303 flow [2025-03-08 17:23:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 17:23:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-08 17:23:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 239 transitions. [2025-03-08 17:23:20,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26555555555555554 [2025-03-08 17:23:20,107 INFO L175 Difference]: Start difference. First operand has 152 places, 161 transitions, 2664 flow. Second operand 15 states and 239 transitions. [2025-03-08 17:23:20,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 200 transitions, 3303 flow [2025-03-08 17:23:20,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 200 transitions, 3149 flow, removed 10 selfloop flow, removed 9 redundant places. [2025-03-08 17:23:20,148 INFO L231 Difference]: Finished difference. Result has 159 places, 136 transitions, 2193 flow [2025-03-08 17:23:20,148 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-08 17:23:20,149 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 106 predicate places. [2025-03-08 17:23:20,149 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 136 transitions, 2193 flow [2025-03-08 17:23:20,149 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-08 17:23:20,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:20,149 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-08 17:23:20,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 17:23:20,149 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-08 17:23:20,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1230900875, now seen corresponding path program 6 times [2025-03-08 17:23:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:20,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026471549] [2025-03-08 17:23:20,150 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:23:20,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:20,162 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:23:20,167 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:20,168 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:23:20,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:20,345 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-08 17:23:20,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:20,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026471549] [2025-03-08 17:23:20,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026471549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:20,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:20,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:23:20,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059973220] [2025-03-08 17:23:20,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:20,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:23:20,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:20,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:23:20,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:23:20,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-08 17:23:20,347 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-08 17:23:20,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:20,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-08 17:23:20,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:20,674 INFO L124 PetriNetUnfolderBase]: 521/1018 cut-off events. [2025-03-08 17:23:20,674 INFO L125 PetriNetUnfolderBase]: For 9761/9761 co-relation queries the response was YES. [2025-03-08 17:23:20,677 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-08 17:23:20,680 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 93 selfloop transitions, 69 changer transitions 0/171 dead transitions. [2025-03-08 17:23:20,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 171 transitions, 2593 flow [2025-03-08 17:23:20,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:23:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 17:23:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 354 transitions. [2025-03-08 17:23:20,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2025-03-08 17:23:20,682 INFO L175 Difference]: Start difference. First operand has 159 places, 136 transitions, 2193 flow. Second operand 12 states and 354 transitions. [2025-03-08 17:23:20,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 171 transitions, 2593 flow [2025-03-08 17:23:20,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 171 transitions, 2230 flow, removed 29 selfloop flow, removed 25 redundant places. [2025-03-08 17:23:20,732 INFO L231 Difference]: Finished difference. Result has 126 places, 140 transitions, 2007 flow [2025-03-08 17:23:20,732 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-08 17:23:20,732 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 73 predicate places. [2025-03-08 17:23:20,732 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 140 transitions, 2007 flow [2025-03-08 17:23:20,733 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-08 17:23:20,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:20,733 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-08 17:23:20,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 17:23:20,733 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-08 17:23:20,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:20,733 INFO L85 PathProgramCache]: Analyzing trace with hash 404091283, now seen corresponding path program 7 times [2025-03-08 17:23:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:20,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536240444] [2025-03-08 17:23:20,734 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:23:20,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:20,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:23:20,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:20,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:20,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:21,210 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-08 17:23:21,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536240444] [2025-03-08 17:23:21,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536240444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:21,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:21,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 17:23:21,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664837184] [2025-03-08 17:23:21,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:21,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 17:23:21,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:21,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 17:23:21,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:23:21,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:21,235 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-08 17:23:21,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:21,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:21,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:21,720 INFO L124 PetriNetUnfolderBase]: 521/1016 cut-off events. [2025-03-08 17:23:21,720 INFO L125 PetriNetUnfolderBase]: For 9187/9187 co-relation queries the response was YES. [2025-03-08 17:23:21,723 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-08 17:23:21,725 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 119 selfloop transitions, 52 changer transitions 41/213 dead transitions. [2025-03-08 17:23:21,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 213 transitions, 3085 flow [2025-03-08 17:23:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 17:23:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-08 17:23:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 257 transitions. [2025-03-08 17:23:21,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2677083333333333 [2025-03-08 17:23:21,727 INFO L175 Difference]: Start difference. First operand has 126 places, 140 transitions, 2007 flow. Second operand 16 states and 257 transitions. [2025-03-08 17:23:21,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 213 transitions, 3085 flow [2025-03-08 17:23:21,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 213 transitions, 2969 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-08 17:23:21,751 INFO L231 Difference]: Finished difference. Result has 138 places, 138 transitions, 2011 flow [2025-03-08 17:23:21,751 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-08 17:23:21,751 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 85 predicate places. [2025-03-08 17:23:21,752 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 138 transitions, 2011 flow [2025-03-08 17:23:21,752 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-08 17:23:21,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:21,752 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-08 17:23:21,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 17:23:21,752 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-08 17:23:21,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:21,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1459080375, now seen corresponding path program 8 times [2025-03-08 17:23:21,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:21,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467265464] [2025-03-08 17:23:21,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:23:21,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:21,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:23:21,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:21,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:23:21,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:22,026 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-08 17:23:22,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:22,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467265464] [2025-03-08 17:23:22,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467265464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:23:22,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:23:22,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:23:22,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977013572] [2025-03-08 17:23:22,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:23:22,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:23:22,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:22,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:23:22,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:23:22,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-08 17:23:22,061 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-08 17:23:22,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:22,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-08 17:23:22,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:22,371 INFO L124 PetriNetUnfolderBase]: 323/664 cut-off events. [2025-03-08 17:23:22,371 INFO L125 PetriNetUnfolderBase]: For 6525/6525 co-relation queries the response was YES. [2025-03-08 17:23:22,374 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-08 17:23:22,376 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 85 selfloop transitions, 66 changer transitions 1/159 dead transitions. [2025-03-08 17:23:22,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 159 transitions, 2337 flow [2025-03-08 17:23:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 17:23:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 17:23:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 298 transitions. [2025-03-08 17:23:22,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.382051282051282 [2025-03-08 17:23:22,380 INFO L175 Difference]: Start difference. First operand has 138 places, 138 transitions, 2011 flow. Second operand 13 states and 298 transitions. [2025-03-08 17:23:22,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 159 transitions, 2337 flow [2025-03-08 17:23:22,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 159 transitions, 2072 flow, removed 31 selfloop flow, removed 16 redundant places. [2025-03-08 17:23:22,399 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 1882 flow [2025-03-08 17:23:22,399 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-08 17:23:22,399 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 83 predicate places. [2025-03-08 17:23:22,399 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 1882 flow [2025-03-08 17:23:22,400 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-08 17:23:22,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:22,400 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-08 17:23:22,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 17:23:22,400 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-08 17:23:22,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:22,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1502042303, now seen corresponding path program 9 times [2025-03-08 17:23:22,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:22,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448468461] [2025-03-08 17:23:22,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:23:22,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:22,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:23:22,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:22,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:23:22,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:22,877 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-08 17:23:22,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:22,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448468461] [2025-03-08 17:23:22,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448468461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:23:22,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052033883] [2025-03-08 17:23:22,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:23:22,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:23:22,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:23:22,880 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-08 17:23:22,882 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-08 17:23:23,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:23:23,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:23,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:23:23,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:23,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-08 17:23:23,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:23:23,101 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 18 treesize of output 7 [2025-03-08 17:23:23,333 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 22 treesize of output 18 [2025-03-08 17:23:23,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:23:23,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-08 17:23:23,469 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-08 17:23:23,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:23:23,725 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-08 17:23:23,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052033883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:23:23,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:23:23,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 27 [2025-03-08 17:23:23,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752581784] [2025-03-08 17:23:23,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:23:23,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 17:23:23,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:23,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 17:23:23,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2025-03-08 17:23:23,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:23,772 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-08 17:23:23,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:23,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:23,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:24,470 INFO L124 PetriNetUnfolderBase]: 322/661 cut-off events. [2025-03-08 17:23:24,470 INFO L125 PetriNetUnfolderBase]: For 6232/6232 co-relation queries the response was YES. [2025-03-08 17:23:24,472 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-08 17:23:24,474 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 84 selfloop transitions, 33 changer transitions 44/162 dead transitions. [2025-03-08 17:23:24,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 162 transitions, 2374 flow [2025-03-08 17:23:24,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 17:23:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-08 17:23:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 233 transitions. [2025-03-08 17:23:24,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2588888888888889 [2025-03-08 17:23:24,475 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 1882 flow. Second operand 15 states and 233 transitions. [2025-03-08 17:23:24,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 162 transitions, 2374 flow [2025-03-08 17:23:24,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 162 transitions, 2203 flow, removed 25 selfloop flow, removed 10 redundant places. [2025-03-08 17:23:24,492 INFO L231 Difference]: Finished difference. Result has 141 places, 110 transitions, 1421 flow [2025-03-08 17:23:24,492 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=15, PETRI_FLOW=1421, PETRI_PLACES=141, PETRI_TRANSITIONS=110} [2025-03-08 17:23:24,492 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 88 predicate places. [2025-03-08 17:23:24,492 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 110 transitions, 1421 flow [2025-03-08 17:23:24,492 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-08 17:23:24,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:24,492 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-08 17:23:24,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:23:24,693 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-08 17:23:24,693 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-08 17:23:24,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash -445674559, now seen corresponding path program 10 times [2025-03-08 17:23:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:24,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976116023] [2025-03-08 17:23:24,694 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:23:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:24,708 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:23:24,719 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:24,719 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:23:24,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:25,175 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-08 17:23:25,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976116023] [2025-03-08 17:23:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976116023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:23:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980468061] [2025-03-08 17:23:25,175 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:23:25,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:23:25,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:23:25,178 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-08 17:23:25,179 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-08 17:23:25,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:23:25,330 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:25,332 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:23:25,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:25,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 17:23:25,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:23:25,349 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 18 treesize of output 7 [2025-03-08 17:23:25,524 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-03-08 17:23:25,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:23:25,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-08 17:23:25,688 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-08 17:23:25,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:23:25,911 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-08 17:23:25,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980468061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:23:25,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:23:25,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2025-03-08 17:23:25,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971312343] [2025-03-08 17:23:25,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:23:25,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 17:23:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:25,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 17:23:25,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2025-03-08 17:23:25,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:25,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 110 transitions, 1421 flow. Second operand has 26 states, 26 states have (on average 13.038461538461538) internal successors, (339), 26 states have internal predecessors, (339), 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-08 17:23:25,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:25,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:25,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:26,615 INFO L124 PetriNetUnfolderBase]: 253/518 cut-off events. [2025-03-08 17:23:26,615 INFO L125 PetriNetUnfolderBase]: For 4309/4309 co-relation queries the response was YES. [2025-03-08 17:23:26,617 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 276 conditions per place. [2025-03-08 17:23:26,618 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 65 selfloop transitions, 27 changer transitions 42/135 dead transitions. [2025-03-08 17:23:26,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 135 transitions, 1829 flow [2025-03-08 17:23:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 17:23:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-08 17:23:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 217 transitions. [2025-03-08 17:23:26,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25833333333333336 [2025-03-08 17:23:26,619 INFO L175 Difference]: Start difference. First operand has 141 places, 110 transitions, 1421 flow. Second operand 14 states and 217 transitions. [2025-03-08 17:23:26,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 135 transitions, 1829 flow [2025-03-08 17:23:26,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 135 transitions, 1609 flow, removed 10 selfloop flow, removed 21 redundant places. [2025-03-08 17:23:26,629 INFO L231 Difference]: Finished difference. Result has 126 places, 78 transitions, 885 flow [2025-03-08 17:23:26,629 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=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=885, PETRI_PLACES=126, PETRI_TRANSITIONS=78} [2025-03-08 17:23:26,629 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 73 predicate places. [2025-03-08 17:23:26,629 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 78 transitions, 885 flow [2025-03-08 17:23:26,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.038461538461538) internal successors, (339), 26 states have internal predecessors, (339), 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-08 17:23:26,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:26,630 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-08 17:23:26,636 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-08 17:23:26,830 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-08 17:23:26,830 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-08 17:23:26,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:26,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1652133481, now seen corresponding path program 11 times [2025-03-08 17:23:26,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:26,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992652194] [2025-03-08 17:23:26,831 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:23:26,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:26,843 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:23:26,849 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:26,850 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:23:26,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:27,292 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-08 17:23:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992652194] [2025-03-08 17:23:27,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992652194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:23:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070062132] [2025-03-08 17:23:27,293 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:23:27,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:23:27,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:23:27,295 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-08 17:23:27,297 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-08 17:23:27,423 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:23:27,467 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:27,467 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:23:27,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:27,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 17:23:27,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:23:27,485 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 18 treesize of output 7 [2025-03-08 17:23:27,652 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-03-08 17:23:27,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:23:27,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-08 17:23:27,820 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-08 17:23:27,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:23:28,037 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-08 17:23:28,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070062132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:23:28,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:23:28,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2025-03-08 17:23:28,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448677639] [2025-03-08 17:23:28,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:23:28,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 17:23:28,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:28,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 17:23:28,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-03-08 17:23:28,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:28,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 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-08 17:23:28,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:28,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:28,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:28,825 INFO L124 PetriNetUnfolderBase]: 219/448 cut-off events. [2025-03-08 17:23:28,825 INFO L125 PetriNetUnfolderBase]: For 3233/3233 co-relation queries the response was YES. [2025-03-08 17:23:28,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2229 conditions, 448 events. 219/448 cut-off events. For 3233/3233 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1811 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-08 17:23:28,828 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 64 selfloop transitions, 28 changer transitions 29/122 dead transitions. [2025-03-08 17:23:28,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 122 transitions, 1435 flow [2025-03-08 17:23:28,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 17:23:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-08 17:23:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 244 transitions. [2025-03-08 17:23:28,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25416666666666665 [2025-03-08 17:23:28,829 INFO L175 Difference]: Start difference. First operand has 126 places, 78 transitions, 885 flow. Second operand 16 states and 244 transitions. [2025-03-08 17:23:28,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 122 transitions, 1435 flow [2025-03-08 17:23:28,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 122 transitions, 1101 flow, removed 10 selfloop flow, removed 34 redundant places. [2025-03-08 17:23:28,835 INFO L231 Difference]: Finished difference. Result has 97 places, 70 transitions, 595 flow [2025-03-08 17:23:28,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=81, 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=16, PETRI_FLOW=595, PETRI_PLACES=97, PETRI_TRANSITIONS=70} [2025-03-08 17:23:28,836 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2025-03-08 17:23:28,836 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 70 transitions, 595 flow [2025-03-08 17:23:28,836 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-08 17:23:28,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:28,836 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-08 17:23:28,844 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-08 17:23:29,036 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-08 17:23:29,037 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-08 17:23:29,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash 444931113, now seen corresponding path program 12 times [2025-03-08 17:23:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:29,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147240809] [2025-03-08 17:23:29,037 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:23:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:29,053 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:23:29,060 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:29,061 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-08 17:23:29,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:29,480 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-08 17:23:29,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:29,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147240809] [2025-03-08 17:23:29,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147240809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:23:29,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278638767] [2025-03-08 17:23:29,481 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:23:29,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:23:29,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:23:29,483 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-08 17:23:29,485 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-08 17:23:29,600 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-08 17:23:29,627 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:29,627 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-08 17:23:29,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:29,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-08 17:23:29,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:23:29,636 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 18 treesize of output 7 [2025-03-08 17:23:29,804 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-03-08 17:23:29,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:23:29,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-08 17:23:29,925 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-08 17:23:29,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:23:30,118 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-08 17:23:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278638767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:23:30,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:23:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 27 [2025-03-08 17:23:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212672849] [2025-03-08 17:23:30,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:23:30,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 17:23:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:30,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 17:23:30,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2025-03-08 17:23:30,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:30,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 70 transitions, 595 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-08 17:23:30,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:30,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:30,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:30,667 INFO L124 PetriNetUnfolderBase]: 193/404 cut-off events. [2025-03-08 17:23:30,667 INFO L125 PetriNetUnfolderBase]: For 1124/1124 co-relation queries the response was YES. [2025-03-08 17:23:30,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 404 events. 193/404 cut-off events. For 1124/1124 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1619 event pairs, 17 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 1661. Up to 112 conditions per place. [2025-03-08 17:23:30,668 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 46 selfloop transitions, 19 changer transitions 41/107 dead transitions. [2025-03-08 17:23:30,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 107 transitions, 1002 flow [2025-03-08 17:23:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 17:23:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-08 17:23:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 211 transitions. [2025-03-08 17:23:30,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2511904761904762 [2025-03-08 17:23:30,669 INFO L175 Difference]: Start difference. First operand has 97 places, 70 transitions, 595 flow. Second operand 14 states and 211 transitions. [2025-03-08 17:23:30,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 107 transitions, 1002 flow [2025-03-08 17:23:30,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 107 transitions, 889 flow, removed 3 selfloop flow, removed 17 redundant places. [2025-03-08 17:23:30,673 INFO L231 Difference]: Finished difference. Result has 89 places, 57 transitions, 432 flow [2025-03-08 17:23:30,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=432, PETRI_PLACES=89, PETRI_TRANSITIONS=57} [2025-03-08 17:23:30,673 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 36 predicate places. [2025-03-08 17:23:30,673 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 57 transitions, 432 flow [2025-03-08 17:23:30,673 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-08 17:23:30,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:23:30,674 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-08 17:23:30,681 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-08 17:23:30,874 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-08 17:23:30,874 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-08 17:23:30,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:23:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1488965353, now seen corresponding path program 13 times [2025-03-08 17:23:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:23:30,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153231727] [2025-03-08 17:23:30,875 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:23:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:23:30,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:23:30,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:30,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:30,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:31,327 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-08 17:23:31,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:23:31,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153231727] [2025-03-08 17:23:31,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153231727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:23:31,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514283589] [2025-03-08 17:23:31,327 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:23:31,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:23:31,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:23:31,329 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-08 17:23:31,330 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-08 17:23:31,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 17:23:31,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 17:23:31,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:23:31,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:23:31,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-08 17:23:31,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:23:31,486 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 18 treesize of output 7 [2025-03-08 17:23:31,595 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 22 treesize of output 18 [2025-03-08 17:23:31,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:23:31,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-08 17:23:31,695 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-08 17:23:31,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:23:31,977 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-08 17:23:31,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514283589] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:23:31,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:23:31,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 25 [2025-03-08 17:23:31,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299239525] [2025-03-08 17:23:31,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:23:31,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 17:23:31,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:23:31,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 17:23:31,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2025-03-08 17:23:31,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-08 17:23:31,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 57 transitions, 432 flow. Second operand has 25 states, 25 states have (on average 12.96) internal successors, (324), 25 states have internal predecessors, (324), 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-08 17:23:31,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:23:31,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-08 17:23:32,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:23:32,622 INFO L124 PetriNetUnfolderBase]: 95/210 cut-off events. [2025-03-08 17:23:32,622 INFO L125 PetriNetUnfolderBase]: For 610/610 co-relation queries the response was YES. [2025-03-08 17:23:32,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 210 events. 95/210 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 644 event pairs, 13 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 816. Up to 80 conditions per place. [2025-03-08 17:23:32,623 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2025-03-08 17:23:32,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 68 transitions, 604 flow [2025-03-08 17:23:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 17:23:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-08 17:23:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 193 transitions. [2025-03-08 17:23:32,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22976190476190475 [2025-03-08 17:23:32,624 INFO L175 Difference]: Start difference. First operand has 89 places, 57 transitions, 432 flow. Second operand 14 states and 193 transitions. [2025-03-08 17:23:32,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 68 transitions, 604 flow [2025-03-08 17:23:32,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 68 transitions, 533 flow, removed 1 selfloop flow, removed 16 redundant places. [2025-03-08 17:23:32,626 INFO L231 Difference]: Finished difference. Result has 80 places, 0 transitions, 0 flow [2025-03-08 17:23:32,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=80, PETRI_TRANSITIONS=0} [2025-03-08 17:23:32,626 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2025-03-08 17:23:32,626 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 0 transitions, 0 flow [2025-03-08 17:23:32,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.96) internal successors, (324), 25 states have internal predecessors, (324), 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-08 17:23:32,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-03-08 17:23:32,632 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-08 17:23:32,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-08 17:23:32,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-08 17:23:32,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-08 17:23:32,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-08 17:23:32,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-03-08 17:23:32,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-03-08 17:23:32,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 17:23:32,833 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-08 17:23:32,834 INFO L422 BasicCegarLoop]: Path program histogram: [13, 9, 1, 1, 1, 1] [2025-03-08 17:23:32,836 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:23:32,836 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:23:32,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:23:32 BasicIcfg [2025-03-08 17:23:32,839 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:23:32,840 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:23:32,840 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:23:32,840 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:23:32,841 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:23:02" (3/4) ... [2025-03-08 17:23:32,842 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 17:23:32,844 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-08 17:23:32,847 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 87 nodes and edges [2025-03-08 17:23:32,848 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-03-08 17:23:32,848 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 17:23:32,848 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 17:23:32,908 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:23:32,908 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:23:32,908 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:23:32,909 INFO L158 Benchmark]: Toolchain (without parser) took 31419.40ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 102.1MB in the beginning and 96.7MB in the end (delta: 5.5MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2025-03-08 17:23:32,909 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 125.4MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:23:32,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.63ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 71.2MB in the end (delta: 31.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 17:23:32,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.86ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 69.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:23:32,910 INFO L158 Benchmark]: Boogie Preprocessor took 54.49ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 64.9MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:23:32,911 INFO L158 Benchmark]: IcfgBuilder took 596.23ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 93.7MB in the end (delta: -28.8MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2025-03-08 17:23:32,911 INFO L158 Benchmark]: TraceAbstraction took 30263.82ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 93.0MB in the beginning and 104.7MB in the end (delta: -11.7MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2025-03-08 17:23:32,912 INFO L158 Benchmark]: Witness Printer took 68.37ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 96.7MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:23:32,913 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.16ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 125.4MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.63ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 71.2MB in the end (delta: 31.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.86ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 69.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.49ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 64.9MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 596.23ms. Allocated memory is still 142.6MB. Free memory was 64.9MB in the beginning and 93.7MB in the end (delta: -28.8MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * TraceAbstraction took 30263.82ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 93.0MB in the beginning and 104.7MB in the end (delta: -11.7MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Witness Printer took 68.37ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 96.7MB in the end (delta: 8.0MB). 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, 69 edges, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.2s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3171 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3019 mSDsluCounter, 3539 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3443 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11317 IncrementalHoareTripleChecker+Invalid, 11636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 96 mSDtfsCounter, 11317 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 769 GetRequests, 289 SyntacticMatches, 7 SemanticMatches, 473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3489occurred in iteration=14, InterpolantAutomatonStates: 324, 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, 12.5s InterpolantComputationTime, 864 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 983 ConstructedInterpolants, 0 QuantifiedInterpolants, 17180 SizeOfPredicates, 140 NumberOfNonLiveVariables, 1600 ConjunctsInSsa, 315 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-08 17:23:32,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE