./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --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/recursified_loop-simple/recursified_nested_5.c -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 c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:48:01,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:48:01,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:48:01,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:48:01,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:48:01,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:48:01,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:48:01,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:48:01,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:48:01,450 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:48:01,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:48:01,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:48:01,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:48:01,451 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:48:01,452 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:48:01,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:48:01,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:48:01,452 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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2025-03-08 05:48:01,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:48:01,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:48:01,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:48:01,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:48:01,720 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:48:01,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-03-08 05:48:02,842 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27f978a1/c4b03da8378b43d097d6973104d9a864/FLAGb5d81b00b [2025-03-08 05:48:03,063 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:48:03,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-03-08 05:48:03,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27f978a1/c4b03da8378b43d097d6973104d9a864/FLAGb5d81b00b [2025-03-08 05:48:03,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f27f978a1/c4b03da8378b43d097d6973104d9a864 [2025-03-08 05:48:03,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:48:03,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:48:03,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:48:03,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:48:03,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:48:03,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f41ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03, skipping insertion in model container [2025-03-08 05:48:03,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:48:03,547 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/recursified_loop-simple/recursified_nested_5.c[2721,2734] [2025-03-08 05:48:03,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:48:03,558 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:48:03,578 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/recursified_loop-simple/recursified_nested_5.c[2721,2734] [2025-03-08 05:48:03,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:48:03,590 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:48:03,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03 WrapperNode [2025-03-08 05:48:03,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:48:03,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:48:03,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:48:03,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:48:03,599 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:48:03" (1/1) ... [2025-03-08 05:48:03,608 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:48:03" (1/1) ... [2025-03-08 05:48:03,629 INFO L138 Inliner]: procedures = 16, calls = 62, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2025-03-08 05:48:03,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:48:03,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:48:03,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:48:03,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:48:03,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,655 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2025-03-08 05:48:03,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:48:03,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:48:03,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:48:03,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:48:03,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03" (1/1) ... [2025-03-08 05:48:03,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:48:03,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:03,693 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 05:48:03,698 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 05:48:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:48:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:48:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:48:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:48:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:48:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:48:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:48:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 05:48:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 05:48:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 05:48:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 05:48:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 05:48:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 05:48:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 05:48:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-03-08 05:48:03,720 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-03-08 05:48:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-03-08 05:48:03,720 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-03-08 05:48:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-03-08 05:48:03,720 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-03-08 05:48:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:48:03,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:48:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 05:48:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 05:48:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 05:48:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 05:48:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 05:48:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 05:48:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2025-03-08 05:48:03,722 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2025-03-08 05:48:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-03-08 05:48:03,722 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-03-08 05:48:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 05:48:03,791 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:48:03,793 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:48:03,941 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset;call ULTIMATE.dealloc(main_~#e~0#1.base, main_~#e~0#1.offset);havoc main_~#e~0#1.base, main_~#e~0#1.offset; [2025-03-08 05:48:03,961 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-08 05:48:03,961 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:48:03,967 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:48:03,969 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:48:03,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:48:03 BoogieIcfgContainer [2025-03-08 05:48:03,970 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:48:03,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:48:03,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:48:03,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:48:03,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:48:03" (1/3) ... [2025-03-08 05:48:03,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516d2ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:48:03, skipping insertion in model container [2025-03-08 05:48:03,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:03" (2/3) ... [2025-03-08 05:48:03,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516d2ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:48:03, skipping insertion in model container [2025-03-08 05:48:03,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:48:03" (3/3) ... [2025-03-08 05:48:03,978 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2025-03-08 05:48:03,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:48:03,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_5.c that has 6 procedures, 51 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:48:04,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:48:04,037 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;@3ec9bffc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:48:04,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:48:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 05:48:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 05:48:04,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:04,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:04,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:04,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash 721021390, now seen corresponding path program 1 times [2025-03-08 05:48:04,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:04,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661622102] [2025-03-08 05:48:04,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:04,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:04,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 05:48:04,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 05:48:04,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:04,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:04,549 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 05:48:04,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:04,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661622102] [2025-03-08 05:48:04,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661622102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:04,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:48:04,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979933246] [2025-03-08 05:48:04,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:04,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:48:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:04,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:48:04,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:48:04,573 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:48:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:04,761 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2025-03-08 05:48:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:48:04,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-08 05:48:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:04,768 INFO L225 Difference]: With dead ends: 68 [2025-03-08 05:48:04,768 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 05:48:04,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:48:04,774 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:04,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 83 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:48:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 05:48:04,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-08 05:48:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.28125) internal successors, (41), 37 states have internal predecessors, (41), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-08 05:48:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2025-03-08 05:48:04,798 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 17 [2025-03-08 05:48:04,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:04,799 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2025-03-08 05:48:04,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:48:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2025-03-08 05:48:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 05:48:04,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:04,801 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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 05:48:04,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:48:04,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:04,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:04,802 INFO L85 PathProgramCache]: Analyzing trace with hash 307057946, now seen corresponding path program 1 times [2025-03-08 05:48:04,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:04,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721297071] [2025-03-08 05:48:04,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:04,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:04,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 05:48:04,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:48:04,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:04,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:48:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721297071] [2025-03-08 05:48:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721297071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:05,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:05,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:48:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737080132] [2025-03-08 05:48:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:05,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:48:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:05,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:48:05,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:48:05,017 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:48:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:05,169 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2025-03-08 05:48:05,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:48:05,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2025-03-08 05:48:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:05,171 INFO L225 Difference]: With dead ends: 97 [2025-03-08 05:48:05,171 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 05:48:05,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:48:05,172 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:05,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 94 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:48:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 05:48:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 05:48:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-08 05:48:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-03-08 05:48:05,181 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 28 [2025-03-08 05:48:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:05,181 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-03-08 05:48:05,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:48:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-03-08 05:48:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 05:48:05,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:05,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 05:48:05,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:48:05,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:05,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:05,183 INFO L85 PathProgramCache]: Analyzing trace with hash -669502447, now seen corresponding path program 1 times [2025-03-08 05:48:05,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:05,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434283637] [2025-03-08 05:48:05,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:05,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:05,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 05:48:05,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 05:48:05,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:05,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:48:05,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434283637] [2025-03-08 05:48:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434283637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:05,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:05,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:48:05,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227132915] [2025-03-08 05:48:05,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:05,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:48:05,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:05,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:48:05,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:48:05,373 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:48:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:05,518 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2025-03-08 05:48:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:48:05,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2025-03-08 05:48:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:05,520 INFO L225 Difference]: With dead ends: 101 [2025-03-08 05:48:05,520 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 05:48:05,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:48:05,521 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:05,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 140 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:48:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 05:48:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-08 05:48:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-08 05:48:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2025-03-08 05:48:05,532 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 39 [2025-03-08 05:48:05,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:05,532 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2025-03-08 05:48:05,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 05:48:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2025-03-08 05:48:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 05:48:05,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:05,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:48:05,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:48:05,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:05,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1595517572, now seen corresponding path program 1 times [2025-03-08 05:48:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:05,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030071091] [2025-03-08 05:48:05,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:05,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 05:48:05,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:48:05,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:05,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:48:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:05,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030071091] [2025-03-08 05:48:05,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030071091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:05,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:05,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:48:05,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468111567] [2025-03-08 05:48:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:05,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:48:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:05,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:48:05,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:48:05,758 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:48:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:05,864 INFO L93 Difference]: Finished difference Result 105 states and 137 transitions. [2025-03-08 05:48:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:48:05,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2025-03-08 05:48:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:05,865 INFO L225 Difference]: With dead ends: 105 [2025-03-08 05:48:05,865 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 05:48:05,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:48:05,866 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 18 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:05,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 168 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:48:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 05:48:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 05:48:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-08 05:48:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-03-08 05:48:05,871 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 50 [2025-03-08 05:48:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:05,871 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-03-08 05:48:05,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:48:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-03-08 05:48:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 05:48:05,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:05,873 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:48:05,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:48:05,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:05,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:05,874 INFO L85 PathProgramCache]: Analyzing trace with hash 697593936, now seen corresponding path program 1 times [2025-03-08 05:48:05,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:05,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121630532] [2025-03-08 05:48:05,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:05,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:05,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 05:48:05,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 05:48:05,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:05,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:48:06,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:06,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121630532] [2025-03-08 05:48:06,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121630532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:06,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:06,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:48:06,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822694139] [2025-03-08 05:48:06,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:06,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:48:06,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:06,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:48:06,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:48:06,109 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:48:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:06,189 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2025-03-08 05:48:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:48:06,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) Word has length 61 [2025-03-08 05:48:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:06,192 INFO L225 Difference]: With dead ends: 109 [2025-03-08 05:48:06,192 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 05:48:06,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:48:06,193 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:06,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 174 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:48:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 05:48:06,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 05:48:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2025-03-08 05:48:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-03-08 05:48:06,206 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 61 [2025-03-08 05:48:06,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:06,206 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-03-08 05:48:06,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:48:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-03-08 05:48:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:48:06,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:06,209 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:48:06,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:48:06,210 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:06,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash 360209277, now seen corresponding path program 1 times [2025-03-08 05:48:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039031620] [2025-03-08 05:48:06,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:06,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:06,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:48:06,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:48:06,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:06,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:48:06,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:06,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039031620] [2025-03-08 05:48:06,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039031620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:06,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:06,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:48:06,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665515465] [2025-03-08 05:48:06,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:06,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:48:06,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:06,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:48:06,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:48:06,298 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 05:48:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:06,322 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-03-08 05:48:06,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:48:06,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2025-03-08 05:48:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:06,324 INFO L225 Difference]: With dead ends: 65 [2025-03-08 05:48:06,324 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 05:48:06,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:48:06,325 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:06,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:48:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 05:48:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2025-03-08 05:48:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 43 states have internal predecessors, (47), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2025-03-08 05:48:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2025-03-08 05:48:06,335 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 66 [2025-03-08 05:48:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:06,336 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2025-03-08 05:48:06,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 05:48:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2025-03-08 05:48:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:48:06,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:06,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:48:06,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:48:06,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:06,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:06,339 INFO L85 PathProgramCache]: Analyzing trace with hash 361132798, now seen corresponding path program 1 times [2025-03-08 05:48:06,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:06,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059771607] [2025-03-08 05:48:06,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:06,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:06,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:48:06,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:48:06,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:06,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:48:06,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:06,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059771607] [2025-03-08 05:48:06,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059771607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:06,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:06,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:48:06,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038197084] [2025-03-08 05:48:06,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:06,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:48:06,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:06,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:48:06,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:48:06,425 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 05:48:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:06,445 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2025-03-08 05:48:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:48:06,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2025-03-08 05:48:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:06,447 INFO L225 Difference]: With dead ends: 65 [2025-03-08 05:48:06,447 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 05:48:06,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:48:06,449 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:06,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 165 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:48:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 05:48:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-03-08 05:48:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2025-03-08 05:48:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2025-03-08 05:48:06,459 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 66 [2025-03-08 05:48:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:06,459 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2025-03-08 05:48:06,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 05:48:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2025-03-08 05:48:06,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:48:06,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:06,460 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:48:06,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:48:06,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:06,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash 361133759, now seen corresponding path program 1 times [2025-03-08 05:48:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:06,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457910052] [2025-03-08 05:48:06,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:06,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:48:06,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:48:06,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:06,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:48:06,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457910052] [2025-03-08 05:48:06,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457910052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859886930] [2025-03-08 05:48:06,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:06,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:06,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:06,869 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 05:48:06,870 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 05:48:06,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:48:06,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:48:06,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:06,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:07,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 05:48:07,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:07,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 05:48:07,184 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:48:07,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:48:07,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859886930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:48:07,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:48:07,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2025-03-08 05:48:07,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904496000] [2025-03-08 05:48:07,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:07,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 05:48:07,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:07,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 05:48:07,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:48:07,982 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand has 22 states, 16 states have (on average 3.9375) internal successors, (63), 19 states have internal predecessors, (63), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-08 05:48:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:08,228 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2025-03-08 05:48:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:48:08,229 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 3.9375) internal successors, (63), 19 states have internal predecessors, (63), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) Word has length 66 [2025-03-08 05:48:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:08,229 INFO L225 Difference]: With dead ends: 123 [2025-03-08 05:48:08,229 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 05:48:08,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:48:08,230 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 21 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:08,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 526 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:48:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 05:48:08,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-08 05:48:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 47 states have internal predecessors, (51), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (17), 12 states have call predecessors, (17), 10 states have call successors, (17) [2025-03-08 05:48:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-03-08 05:48:08,239 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 66 [2025-03-08 05:48:08,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:08,239 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-03-08 05:48:08,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 3.9375) internal successors, (63), 19 states have internal predecessors, (63), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-08 05:48:08,239 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-03-08 05:48:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:48:08,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:08,240 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:48:08,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:48:08,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:08,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:08,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:08,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1620666687, now seen corresponding path program 2 times [2025-03-08 05:48:08,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:08,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239700186] [2025-03-08 05:48:08,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:48:08,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:08,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-08 05:48:08,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:48:08,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:48:08,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:48:09,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:09,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239700186] [2025-03-08 05:48:09,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239700186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:09,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186308234] [2025-03-08 05:48:09,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:48:09,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:09,031 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 05:48:09,035 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 05:48:09,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-08 05:48:09,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:48:09,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:48:09,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:09,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 05:48:09,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:09,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 05:48:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:48:09,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 05:48:09,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186308234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:48:09,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:48:09,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 28 [2025-03-08 05:48:09,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030630482] [2025-03-08 05:48:09,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:09,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:48:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:09,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:48:09,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:48:09,962 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 28 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 24 states have internal predecessors, (72), 11 states have call successors, (21), 6 states have call predecessors, (21), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-08 05:48:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:10,398 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2025-03-08 05:48:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:48:10,399 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 24 states have internal predecessors, (72), 11 states have call successors, (21), 6 states have call predecessors, (21), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) Word has length 76 [2025-03-08 05:48:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:10,400 INFO L225 Difference]: With dead ends: 131 [2025-03-08 05:48:10,401 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 05:48:10,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1328, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 05:48:10,403 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 85 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:10,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 494 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:48:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 05:48:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 05:48:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 49 states have internal predecessors, (53), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2025-03-08 05:48:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2025-03-08 05:48:10,415 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 76 [2025-03-08 05:48:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:10,415 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2025-03-08 05:48:10,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 24 states have internal predecessors, (72), 11 states have call successors, (21), 6 states have call predecessors, (21), 10 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-08 05:48:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2025-03-08 05:48:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:48:10,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:10,420 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:48:10,429 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 05:48:10,620 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,SelfDestructingSolverStorable8 [2025-03-08 05:48:10,621 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:10,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:10,621 INFO L85 PathProgramCache]: Analyzing trace with hash 777458876, now seen corresponding path program 3 times [2025-03-08 05:48:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:10,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487765833] [2025-03-08 05:48:10,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:48:10,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:10,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 10 equivalence classes. [2025-03-08 05:48:10,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 112 statements. [2025-03-08 05:48:10,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:48:10,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-08 05:48:10,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:10,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487765833] [2025-03-08 05:48:10,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487765833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:10,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112172837] [2025-03-08 05:48:10,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:48:10,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:10,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:10,866 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 05:48:10,869 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 05:48:10,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 10 equivalence classes. [2025-03-08 05:48:10,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 112 statements. [2025-03-08 05:48:10,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:48:10,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:10,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 05:48:10,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:10,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 05:48:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-08 05:48:11,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 05:48:11,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112172837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:48:11,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:48:11,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2025-03-08 05:48:11,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610190185] [2025-03-08 05:48:11,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:11,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 05:48:11,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:11,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 05:48:11,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:48:11,555 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 23 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 20 states have internal predecessors, (55), 9 states have call successors, (15), 4 states have call predecessors, (15), 7 states have return successors, (16), 9 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-08 05:48:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:11,910 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2025-03-08 05:48:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:48:11,910 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 20 states have internal predecessors, (55), 9 states have call successors, (15), 4 states have call predecessors, (15), 7 states have return successors, (16), 9 states have call predecessors, (16), 9 states have call successors, (16) Word has length 112 [2025-03-08 05:48:11,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:11,911 INFO L225 Difference]: With dead ends: 91 [2025-03-08 05:48:11,911 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 05:48:11,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:48:11,912 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 72 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:11,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 160 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:48:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 05:48:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-08 05:48:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.1875) internal successors, (57), 52 states have internal predecessors, (57), 10 states have call successors, (10), 5 states have call predecessors, (10), 16 states have return successors, (22), 17 states have call predecessors, (22), 10 states have call successors, (22) [2025-03-08 05:48:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2025-03-08 05:48:11,925 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 112 [2025-03-08 05:48:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:11,926 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2025-03-08 05:48:11,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 20 states have internal predecessors, (55), 9 states have call successors, (15), 4 states have call predecessors, (15), 7 states have return successors, (16), 9 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-08 05:48:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2025-03-08 05:48:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 05:48:11,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:11,929 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:11,935 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 05:48:12,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:12,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:12,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:12,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1469092833, now seen corresponding path program 1 times [2025-03-08 05:48:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:12,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251961326] [2025-03-08 05:48:12,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:12,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 05:48:12,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 05:48:12,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:12,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2025-03-08 05:48:12,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251961326] [2025-03-08 05:48:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251961326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892268974] [2025-03-08 05:48:12,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:12,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:12,590 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 05:48:12,591 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 05:48:12,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 05:48:12,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 05:48:12,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:12,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:12,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-08 05:48:12,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:12,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 05:48:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 665 proven. 24 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 05:48:13,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 270 proven. 165 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-03-08 05:48:15,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892268974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:48:15,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:48:15,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 22] total 39 [2025-03-08 05:48:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347952165] [2025-03-08 05:48:15,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:15,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 05:48:15,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:15,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 05:48:15,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1240, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 05:48:15,986 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand has 39 states, 30 states have (on average 3.033333333333333) internal successors, (91), 32 states have internal predecessors, (91), 12 states have call successors, (30), 9 states have call predecessors, (30), 14 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-03-08 05:48:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:16,573 INFO L93 Difference]: Finished difference Result 151 states and 191 transitions. [2025-03-08 05:48:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:48:16,573 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 30 states have (on average 3.033333333333333) internal successors, (91), 32 states have internal predecessors, (91), 12 states have call successors, (30), 9 states have call predecessors, (30), 14 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 207 [2025-03-08 05:48:16,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:16,574 INFO L225 Difference]: With dead ends: 151 [2025-03-08 05:48:16,574 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 05:48:16,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=461, Invalid=2401, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 05:48:16,575 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:16,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 575 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:48:16,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 05:48:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 05:48:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.18) internal successors, (59), 54 states have internal predecessors, (59), 10 states have call successors, (10), 5 states have call predecessors, (10), 18 states have return successors, (24), 19 states have call predecessors, (24), 10 states have call successors, (24) [2025-03-08 05:48:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2025-03-08 05:48:16,585 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 207 [2025-03-08 05:48:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:16,585 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2025-03-08 05:48:16,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 30 states have (on average 3.033333333333333) internal successors, (91), 32 states have internal predecessors, (91), 12 states have call successors, (30), 9 states have call predecessors, (30), 14 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2025-03-08 05:48:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2025-03-08 05:48:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-08 05:48:16,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:16,588 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 40, 40, 40, 12, 12, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:16,596 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 05:48:16,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:16,789 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:16,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:16,789 INFO L85 PathProgramCache]: Analyzing trace with hash -981564517, now seen corresponding path program 2 times [2025-03-08 05:48:16,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:16,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904670517] [2025-03-08 05:48:16,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:48:16,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:16,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 393 statements into 2 equivalence classes. [2025-03-08 05:48:16,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 393 of 393 statements. [2025-03-08 05:48:16,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:48:16,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5760 backedges. 65 proven. 130 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-08 05:48:17,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:17,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904670517] [2025-03-08 05:48:17,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904670517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:17,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347677344] [2025-03-08 05:48:17,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:48:17,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:17,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:17,880 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 05:48:17,882 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 05:48:18,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 393 statements into 2 equivalence classes. [2025-03-08 05:48:18,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 393 of 393 statements. [2025-03-08 05:48:18,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:48:18,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:18,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 1962 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-08 05:48:18,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:18,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 05:48:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5760 backedges. 1336 proven. 35 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2025-03-08 05:48:18,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5760 backedges. 1280 proven. 70 refuted. 0 times theorem prover too weak. 4410 trivial. 0 not checked. [2025-03-08 05:48:23,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347677344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:48:23,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:48:23,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 26] total 46 [2025-03-08 05:48:23,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360531024] [2025-03-08 05:48:23,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:23,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 05:48:23,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:23,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 05:48:23,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1748, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 05:48:23,360 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 46 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 38 states have internal predecessors, (93), 14 states have call successors, (31), 10 states have call predecessors, (31), 17 states have return successors, (41), 16 states have call predecessors, (41), 14 states have call successors, (41) [2025-03-08 05:48:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:23,931 INFO L93 Difference]: Finished difference Result 159 states and 200 transitions. [2025-03-08 05:48:23,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:48:23,932 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 38 states have internal predecessors, (93), 14 states have call successors, (31), 10 states have call predecessors, (31), 17 states have return successors, (41), 16 states have call predecessors, (41), 14 states have call successors, (41) Word has length 393 [2025-03-08 05:48:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:23,933 INFO L225 Difference]: With dead ends: 159 [2025-03-08 05:48:23,933 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 05:48:23,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 753 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=582, Invalid=3078, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 05:48:23,935 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 107 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:23,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 781 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:48:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 05:48:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-08 05:48:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 56 states have internal predecessors, (61), 10 states have call successors, (10), 5 states have call predecessors, (10), 20 states have return successors, (26), 21 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-08 05:48:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2025-03-08 05:48:23,945 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 393 [2025-03-08 05:48:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:23,945 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2025-03-08 05:48:23,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 38 states have internal predecessors, (93), 14 states have call successors, (31), 10 states have call predecessors, (31), 17 states have return successors, (41), 16 states have call predecessors, (41), 14 states have call successors, (41) [2025-03-08 05:48:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2025-03-08 05:48:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-08 05:48:23,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:23,950 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 72, 72, 72, 16, 16, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:23,960 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 05:48:24,151 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,SelfDestructingSolverStorable11 [2025-03-08 05:48:24,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:24,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:24,152 INFO L85 PathProgramCache]: Analyzing trace with hash -111887509, now seen corresponding path program 3 times [2025-03-08 05:48:24,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:24,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750612005] [2025-03-08 05:48:24,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:48:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:24,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 597 statements into 15 equivalence classes. [2025-03-08 05:48:24,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 597 statements. [2025-03-08 05:48:24,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 05:48:24,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 17298 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 17286 trivial. 0 not checked. [2025-03-08 05:48:24,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:24,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750612005] [2025-03-08 05:48:24,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750612005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:24,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969762158] [2025-03-08 05:48:24,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:48:24,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:24,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:24,428 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:48:24,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:48:24,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 597 statements into 15 equivalence classes. [2025-03-08 05:48:24,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 597 statements. [2025-03-08 05:48:24,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 05:48:24,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:24,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 05:48:24,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:24,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 05:48:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17298 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17290 trivial. 0 not checked. [2025-03-08 05:48:24,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 17298 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 17283 trivial. 0 not checked. [2025-03-08 05:48:26,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969762158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:48:26,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:48:26,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 28 [2025-03-08 05:48:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412840626] [2025-03-08 05:48:26,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:26,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:48:26,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:26,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:48:26,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:48:26,962 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 28 states, 20 states have (on average 2.95) internal successors, (59), 24 states have internal predecessors, (59), 13 states have call successors, (19), 5 states have call predecessors, (19), 8 states have return successors, (20), 11 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-08 05:48:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:27,220 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2025-03-08 05:48:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:48:27,220 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 20 states have (on average 2.95) internal successors, (59), 24 states have internal predecessors, (59), 13 states have call successors, (19), 5 states have call predecessors, (19), 8 states have return successors, (20), 11 states have call predecessors, (20), 13 states have call successors, (20) Word has length 597 [2025-03-08 05:48:27,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:27,222 INFO L225 Difference]: With dead ends: 100 [2025-03-08 05:48:27,222 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 05:48:27,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1211 GetRequests, 1179 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 05:48:27,222 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 69 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:27,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 214 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:48:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 05:48:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-08 05:48:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 56 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 21 states have return successors, (26), 21 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-08 05:48:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2025-03-08 05:48:27,228 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 597 [2025-03-08 05:48:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:27,228 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2025-03-08 05:48:27,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 20 states have (on average 2.95) internal successors, (59), 24 states have internal predecessors, (59), 13 states have call successors, (19), 5 states have call predecessors, (19), 8 states have return successors, (20), 11 states have call predecessors, (20), 13 states have call successors, (20) [2025-03-08 05:48:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2025-03-08 05:48:27,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1178 [2025-03-08 05:48:27,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:27,252 INFO L218 NwaCegarLoop]: trace histogram [168, 168, 144, 144, 144, 32, 32, 24, 24, 24, 24, 24, 24, 24, 12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:27,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:48:27,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:27,453 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:27,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash 392917444, now seen corresponding path program 4 times [2025-03-08 05:48:27,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:27,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219705060] [2025-03-08 05:48:27,453 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:48:27,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:27,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1177 statements into 2 equivalence classes. [2025-03-08 05:48:27,576 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1176 of 1177 statements. [2025-03-08 05:48:27,576 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:48:27,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 69756 backedges. 430 proven. 311 refuted. 0 times theorem prover too weak. 69015 trivial. 0 not checked. [2025-03-08 05:48:32,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:32,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219705060] [2025-03-08 05:48:32,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219705060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:32,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453415367] [2025-03-08 05:48:32,351 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:48:32,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:32,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:32,353 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:48:32,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:48:32,700 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1177 statements into 2 equivalence classes. [2025-03-08 05:48:33,088 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1176 of 1177 statements. [2025-03-08 05:48:33,088 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:48:33,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:33,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 5354 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 05:48:33,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:33,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 05:48:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 69756 backedges. 35191 proven. 8 refuted. 0 times theorem prover too weak. 34557 trivial. 0 not checked. [2025-03-08 05:48:33,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 69756 backedges. 71 proven. 129 refuted. 0 times theorem prover too weak. 69556 trivial. 0 not checked. [2025-03-08 05:48:37,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453415367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:48:37,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:48:37,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 33 [2025-03-08 05:48:37,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397456991] [2025-03-08 05:48:37,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:37,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 05:48:37,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:37,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 05:48:37,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 05:48:37,993 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 33 states, 25 states have (on average 3.76) internal successors, (94), 28 states have internal predecessors, (94), 15 states have call successors, (35), 7 states have call predecessors, (35), 12 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) [2025-03-08 05:48:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:38,408 INFO L93 Difference]: Finished difference Result 167 states and 204 transitions. [2025-03-08 05:48:38,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:48:38,409 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 3.76) internal successors, (94), 28 states have internal predecessors, (94), 15 states have call successors, (35), 7 states have call predecessors, (35), 12 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) Word has length 1177 [2025-03-08 05:48:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:38,409 INFO L225 Difference]: With dead ends: 167 [2025-03-08 05:48:38,410 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 05:48:38,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2383 GetRequests, 2339 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=1755, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 05:48:38,411 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:38,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 460 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:48:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 05:48:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 05:48:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.169811320754717) internal successors, (62), 58 states have internal predecessors, (62), 10 states have call successors, (10), 5 states have call predecessors, (10), 23 states have return successors, (28), 23 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-08 05:48:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2025-03-08 05:48:38,420 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 1177 [2025-03-08 05:48:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:38,420 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2025-03-08 05:48:38,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 3.76) internal successors, (94), 28 states have internal predecessors, (94), 15 states have call successors, (35), 7 states have call predecessors, (35), 12 states have return successors, (40), 14 states have call predecessors, (40), 15 states have call successors, (40) [2025-03-08 05:48:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2025-03-08 05:48:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2206 [2025-03-08 05:48:38,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:38,462 INFO L218 NwaCegarLoop]: trace histogram [336, 336, 288, 288, 288, 60, 60, 48, 48, 48, 48, 48, 48, 48, 16, 16, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:38,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 05:48:38,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:38,663 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:38,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1704646992, now seen corresponding path program 5 times [2025-03-08 05:48:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681720888] [2025-03-08 05:48:38,664 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:48:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:38,805 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2205 statements into 28 equivalence classes. [2025-03-08 05:48:40,735 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 1868 of 2205 statements. [2025-03-08 05:48:40,735 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-08 05:48:40,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat