./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-03 14:38:04,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:38:04,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:38:04,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:38:04,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:38:04,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:38:04,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:38:04,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:38:04,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:38:04,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:38:04,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:38:04,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:38:04,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:38:04,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:38:04,673 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:38:04,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:38:04,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:38:04,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:38:04,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:38:04,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:38:04,677 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:38:04,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:38:04,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:38:04,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:38:04,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:38:04,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:38:04,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:38:04,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:38:04,677 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-03 14:38:04,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:38:04,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:38:04,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:38:04,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:38:04,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:38:04,919 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-03 14:38:06,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d56b48de3/b0c93021cacb464db37adb098996c655/FLAGfd2a6a472 [2025-03-03 14:38:06,339 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:38:06,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-03-03 14:38:06,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d56b48de3/b0c93021cacb464db37adb098996c655/FLAGfd2a6a472 [2025-03-03 14:38:06,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d56b48de3/b0c93021cacb464db37adb098996c655 [2025-03-03 14:38:06,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:38:06,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:38:06,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:38:06,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:38:06,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:38:06,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d3808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06, skipping insertion in model container [2025-03-03 14:38:06,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:38:06,788 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-03 14:38:06,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:38:06,798 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:38:06,811 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-03 14:38:06,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:38:06,821 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:38:06,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06 WrapperNode [2025-03-03 14:38:06,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:38:06,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:38:06,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:38:06,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:38:06,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,844 INFO L138 Inliner]: procedures = 16, calls = 62, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2025-03-03 14:38:06,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:38:06,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:38:06,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:38:06,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:38:06,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,862 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-03 14:38:06,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:38:06,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:38:06,876 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:38:06,876 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:38:06,877 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (1/1) ... [2025-03-03 14:38:06,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:38:06,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:06,900 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-03 14:38:06,902 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-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-03-03 14:38:06,919 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-03-03 14:38:06,919 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-03-03 14:38:06,919 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-03-03 14:38:06,922 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-03-03 14:38:06,922 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-03-03 14:38:06,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:38:06,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:38:06,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:38:06,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:38:06,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:38:06,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:38:06,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 14:38:06,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 14:38:06,923 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2025-03-03 14:38:06,923 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2025-03-03 14:38:06,923 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-03-03 14:38:06,923 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-03-03 14:38:06,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 14:38:06,991 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:38:06,992 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:38:07,146 INFO L1325 $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-03 14:38:07,175 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 14:38:07,176 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:38:07,183 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:38:07,185 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:38:07,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:38:07 BoogieIcfgContainer [2025-03-03 14:38:07,186 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:38:07,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:38:07,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:38:07,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:38:07,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:38:06" (1/3) ... [2025-03-03 14:38:07,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5153d799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:38:07, skipping insertion in model container [2025-03-03 14:38:07,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:06" (2/3) ... [2025-03-03 14:38:07,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5153d799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:38:07, skipping insertion in model container [2025-03-03 14:38:07,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:38:07" (3/3) ... [2025-03-03 14:38:07,196 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2025-03-03 14:38:07,208 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:38:07,212 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-03 14:38:07,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:38:07,272 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;@6a00a196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:38:07,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:38:07,276 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-03 14:38:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 14:38:07,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:07,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:07,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:07,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:07,289 INFO L85 PathProgramCache]: Analyzing trace with hash 721021390, now seen corresponding path program 1 times [2025-03-03 14:38:07,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:07,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942701556] [2025-03-03 14:38:07,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:07,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:07,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 14:38:07,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 14:38:07,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:07,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:07,825 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-03 14:38:07,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:07,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942701556] [2025-03-03 14:38:07,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942701556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:07,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:07,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:07,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264401547] [2025-03-03 14:38:07,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:07,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:07,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:07,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:07,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:07,848 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-03 14:38:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:08,053 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2025-03-03 14:38:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:08,055 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-03 14:38:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:08,059 INFO L225 Difference]: With dead ends: 68 [2025-03-03 14:38:08,059 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 14:38:08,061 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-03 14:38:08,062 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:08,063 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.2s Time] [2025-03-03 14:38:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 14:38:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 14:38:08,087 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-03 14:38:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2025-03-03 14:38:08,093 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 17 [2025-03-03 14:38:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:08,093 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2025-03-03 14:38:08,094 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-03 14:38:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2025-03-03 14:38:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 14:38:08,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:08,096 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-03 14:38:08,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:38:08,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:08,098 INFO L85 PathProgramCache]: Analyzing trace with hash 307057946, now seen corresponding path program 1 times [2025-03-03 14:38:08,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:08,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696216165] [2025-03-03 14:38:08,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:08,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:08,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 14:38:08,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 14:38:08,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:08,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:08,311 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-03 14:38:08,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:08,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696216165] [2025-03-03 14:38:08,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696216165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:08,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:08,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:08,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993829624] [2025-03-03 14:38:08,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:08,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:08,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:08,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:08,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:08,312 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-03 14:38:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:08,444 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2025-03-03 14:38:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:08,444 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-03 14:38:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:08,445 INFO L225 Difference]: With dead ends: 97 [2025-03-03 14:38:08,445 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 14:38:08,446 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-03 14:38:08,447 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-03 14:38:08,447 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-03 14:38:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 14:38:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-03 14:38:08,454 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-03 14:38:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-03-03 14:38:08,455 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 28 [2025-03-03 14:38:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:08,455 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-03-03 14:38:08,455 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-03 14:38:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-03-03 14:38:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 14:38:08,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:08,458 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-03 14:38:08,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:38:08,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:08,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash -669502447, now seen corresponding path program 1 times [2025-03-03 14:38:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:08,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239809283] [2025-03-03 14:38:08,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:08,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:08,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 14:38:08,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 14:38:08,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:08,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:08,651 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-03 14:38:08,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:08,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239809283] [2025-03-03 14:38:08,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239809283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:08,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:08,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:08,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119314741] [2025-03-03 14:38:08,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:08,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:08,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:08,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:08,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:08,653 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-03 14:38:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:08,770 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2025-03-03 14:38:08,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:08,771 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-03 14:38:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:08,772 INFO L225 Difference]: With dead ends: 101 [2025-03-03 14:38:08,772 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 14:38:08,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-03 14:38:08,772 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-03 14:38:08,773 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-03 14:38:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 14:38:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-03 14:38:08,780 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-03 14:38:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2025-03-03 14:38:08,783 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 39 [2025-03-03 14:38:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:08,784 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2025-03-03 14:38:08,784 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-03 14:38:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2025-03-03 14:38:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 14:38:08,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:08,786 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-03 14:38:08,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:38:08,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:08,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1595517572, now seen corresponding path program 1 times [2025-03-03 14:38:08,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:08,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701608785] [2025-03-03 14:38:08,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:08,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:08,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 14:38:08,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 14:38:08,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:08,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:08,984 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-03 14:38:08,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:08,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701608785] [2025-03-03 14:38:08,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701608785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:08,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:08,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:08,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141310985] [2025-03-03 14:38:08,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:08,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:08,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:08,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:08,986 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-03 14:38:09,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:09,097 INFO L93 Difference]: Finished difference Result 105 states and 137 transitions. [2025-03-03 14:38:09,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:09,097 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-03 14:38:09,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:09,098 INFO L225 Difference]: With dead ends: 105 [2025-03-03 14:38:09,098 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 14:38:09,099 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-03 14:38:09,099 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-03 14:38:09,099 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-03 14:38:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 14:38:09,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 14:38:09,104 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-03 14:38:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-03-03 14:38:09,105 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 50 [2025-03-03 14:38:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:09,105 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-03-03 14:38:09,105 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-03 14:38:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-03-03 14:38:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:38:09,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:09,106 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-03 14:38:09,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:38:09,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:09,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash 697593936, now seen corresponding path program 1 times [2025-03-03 14:38:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:09,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199845205] [2025-03-03 14:38:09,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:09,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:38:09,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:38:09,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:09,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,349 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-03 14:38:09,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199845205] [2025-03-03 14:38:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199845205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:09,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:09,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251232548] [2025-03-03 14:38:09,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:09,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:09,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:09,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:09,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:09,352 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-03 14:38:09,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:09,435 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2025-03-03 14:38:09,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:09,435 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-03 14:38:09,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:09,436 INFO L225 Difference]: With dead ends: 109 [2025-03-03 14:38:09,436 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 14:38:09,436 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-03 14:38:09,437 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-03 14:38:09,437 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-03 14:38:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 14:38:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 14:38:09,442 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-03 14:38:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-03-03 14:38:09,443 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 61 [2025-03-03 14:38:09,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:09,443 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-03-03 14:38:09,443 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-03 14:38:09,443 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-03-03 14:38:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:38:09,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:09,444 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-03 14:38:09,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:38:09,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:09,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:09,445 INFO L85 PathProgramCache]: Analyzing trace with hash 360209277, now seen corresponding path program 1 times [2025-03-03 14:38:09,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:09,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068667967] [2025-03-03 14:38:09,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:09,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:09,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:38:09,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:38:09,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:09,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,536 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-03 14:38:09,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:09,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068667967] [2025-03-03 14:38:09,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068667967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:09,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:09,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:38:09,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210650272] [2025-03-03 14:38:09,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:09,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:38:09,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:09,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:38:09,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:38:09,540 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-03 14:38:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:09,562 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-03-03 14:38:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:38:09,563 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-03 14:38:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:09,565 INFO L225 Difference]: With dead ends: 65 [2025-03-03 14:38:09,565 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 14:38:09,565 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-03 14:38:09,566 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-03 14:38:09,566 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-03 14:38:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 14:38:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2025-03-03 14:38:09,573 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-03 14:38:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2025-03-03 14:38:09,574 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 66 [2025-03-03 14:38:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:09,575 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2025-03-03 14:38:09,575 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-03 14:38:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2025-03-03 14:38:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:38:09,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:09,577 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-03 14:38:09,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:38:09,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:09,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash 361132798, now seen corresponding path program 1 times [2025-03-03 14:38:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:09,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680326807] [2025-03-03 14:38:09,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:09,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:09,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:38:09,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:38:09,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:09,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,667 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-03 14:38:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680326807] [2025-03-03 14:38:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680326807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:09,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:09,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:38:09,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338247856] [2025-03-03 14:38:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:09,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:38:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:09,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:38:09,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:38:09,669 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-03 14:38:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:09,687 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2025-03-03 14:38:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:38:09,687 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-03 14:38:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:09,690 INFO L225 Difference]: With dead ends: 65 [2025-03-03 14:38:09,690 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 14:38:09,690 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-03 14:38:09,691 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-03 14:38:09,691 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-03 14:38:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 14:38:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-03-03 14:38:09,697 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-03 14:38:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2025-03-03 14:38:09,697 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 66 [2025-03-03 14:38:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:09,698 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2025-03-03 14:38:09,698 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-03 14:38:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2025-03-03 14:38:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:38:09,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:09,699 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-03 14:38:09,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:38:09,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:09,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash 361133759, now seen corresponding path program 1 times [2025-03-03 14:38:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:09,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919470261] [2025-03-03 14:38:09,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:09,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:09,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:38:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:38:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:09,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:10,089 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-03 14:38:10,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:10,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919470261] [2025-03-03 14:38:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919470261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:10,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588027705] [2025-03-03 14:38:10,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:10,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:10,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:10,094 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-03 14:38:10,096 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-03 14:38:10,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:38:10,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:38:10,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:10,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:10,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 14:38:10,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:10,266 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-03 14:38:10,404 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-03 14:38:10,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:11,208 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-03 14:38:11,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588027705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:11,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:11,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2025-03-03 14:38:11,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288429632] [2025-03-03 14:38:11,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:11,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:38:11,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:11,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:38:11,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:38:11,210 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-03 14:38:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:11,464 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2025-03-03 14:38:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:38:11,464 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-03 14:38:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:11,465 INFO L225 Difference]: With dead ends: 123 [2025-03-03 14:38:11,466 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 14:38:11,467 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-03 14:38:11,467 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-03 14:38:11,470 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-03 14:38:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 14:38:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-03 14:38:11,475 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-03 14:38:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-03-03 14:38:11,475 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 66 [2025-03-03 14:38:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:11,476 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-03-03 14:38:11,476 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-03 14:38:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-03-03 14:38:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:38:11,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:11,477 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-03 14:38:11,484 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-03 14:38:11,681 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-03 14:38:11,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:11,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:11,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1620666687, now seen corresponding path program 2 times [2025-03-03 14:38:11,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:11,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282109695] [2025-03-03 14:38:11,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:11,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:11,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-03 14:38:11,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:38:11,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:11,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:12,264 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-03 14:38:12,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:12,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282109695] [2025-03-03 14:38:12,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282109695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:12,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761519458] [2025-03-03 14:38:12,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:12,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:12,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:12,267 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-03 14:38:12,268 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-03 14:38:12,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-03 14:38:12,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:38:12,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:12,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:12,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 14:38:12,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:12,391 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-03 14:38:12,523 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-03 14:38:12,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:13,185 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-03 14:38:13,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761519458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:13,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:13,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 28 [2025-03-03 14:38:13,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295382288] [2025-03-03 14:38:13,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:13,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:38:13,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:13,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:38:13,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:38:13,187 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-03 14:38:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:13,585 INFO L93 Difference]: Finished difference Result 131 states and 166 transitions. [2025-03-03 14:38:13,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:38:13,585 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-03 14:38:13,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:13,589 INFO L225 Difference]: With dead ends: 131 [2025-03-03 14:38:13,590 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 14:38:13,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=1328, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 14:38:13,591 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-03 14:38:13,591 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-03 14:38:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 14:38:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-03 14:38:13,597 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-03 14:38:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2025-03-03 14:38:13,598 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 76 [2025-03-03 14:38:13,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:13,598 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2025-03-03 14:38:13,598 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-03 14:38:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2025-03-03 14:38:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:38:13,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:13,599 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-03 14:38:13,606 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-03 14:38:13,799 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-03 14:38:13,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:13,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:13,800 INFO L85 PathProgramCache]: Analyzing trace with hash 777458876, now seen corresponding path program 3 times [2025-03-03 14:38:13,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:13,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446325108] [2025-03-03 14:38:13,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:13,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:13,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 10 equivalence classes. [2025-03-03 14:38:13,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 112 statements. [2025-03-03 14:38:13,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:38:13,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:14,050 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-03 14:38:14,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:14,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446325108] [2025-03-03 14:38:14,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446325108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:14,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156815162] [2025-03-03 14:38:14,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:14,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:14,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:14,052 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-03 14:38:14,054 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-03 14:38:14,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 10 equivalence classes. [2025-03-03 14:38:14,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 112 statements. [2025-03-03 14:38:14,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:38:14,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:14,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 14:38:14,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:14,175 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-03 14:38:14,275 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-03 14:38:14,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:14,757 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-03 14:38:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156815162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:14,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:14,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2025-03-03 14:38:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802026490] [2025-03-03 14:38:14,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:14,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 14:38:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:14,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 14:38:14,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:38:14,759 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-03 14:38:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:15,110 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2025-03-03 14:38:15,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:38:15,110 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-03 14:38:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:15,112 INFO L225 Difference]: With dead ends: 91 [2025-03-03 14:38:15,113 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 14:38:15,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:38:15,113 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-03 14:38:15,114 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-03 14:38:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 14:38:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-03 14:38:15,123 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-03 14:38:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2025-03-03 14:38:15,123 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 112 [2025-03-03 14:38:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:15,124 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2025-03-03 14:38:15,124 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-03 14:38:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2025-03-03 14:38:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 14:38:15,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:15,125 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-03 14:38:15,136 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-03 14:38:15,325 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-03 14:38:15,326 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:15,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1469092833, now seen corresponding path program 1 times [2025-03-03 14:38:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:15,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794915199] [2025-03-03 14:38:15,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:15,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 14:38:15,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 14:38:15,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:15,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:15,762 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-03 14:38:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794915199] [2025-03-03 14:38:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794915199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322312049] [2025-03-03 14:38:15,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:15,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:15,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:15,764 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-03 14:38:15,766 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-03 14:38:15,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 14:38:15,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 14:38:15,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:15,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:15,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-03 14:38:15,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:15,976 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-03 14:38:16,244 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-03 14:38:16,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:18,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-03 14:38:18,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322312049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:18,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:18,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 22] total 39 [2025-03-03 14:38:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939228855] [2025-03-03 14:38:18,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:18,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 14:38:18,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:18,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 14:38:18,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1240, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 14:38:18,987 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-03 14:38:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:19,526 INFO L93 Difference]: Finished difference Result 151 states and 191 transitions. [2025-03-03 14:38:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:38:19,528 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-03 14:38:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:19,529 INFO L225 Difference]: With dead ends: 151 [2025-03-03 14:38:19,529 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 14:38:19,530 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-03 14:38:19,530 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-03 14:38:19,531 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-03 14:38:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 14:38:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 14:38:19,536 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-03 14:38:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2025-03-03 14:38:19,537 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 207 [2025-03-03 14:38:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:19,537 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2025-03-03 14:38:19,537 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-03 14:38:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2025-03-03 14:38:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-03 14:38:19,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:19,543 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-03 14:38:19,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:38:19,744 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-03 14:38:19,744 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:19,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash -981564517, now seen corresponding path program 2 times [2025-03-03 14:38:19,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114082673] [2025-03-03 14:38:19,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:19,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 393 statements into 2 equivalence classes. [2025-03-03 14:38:19,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 393 of 393 statements. [2025-03-03 14:38:19,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:19,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:20,825 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-03 14:38:20,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:20,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114082673] [2025-03-03 14:38:20,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114082673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:20,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506696240] [2025-03-03 14:38:20,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:20,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:20,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:20,828 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-03 14:38:20,830 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-03 14:38:20,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 393 statements into 2 equivalence classes. [2025-03-03 14:38:21,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 393 of 393 statements. [2025-03-03 14:38:21,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:21,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:21,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 1962 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-03 14:38:21,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:21,162 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-03 14:38:21,401 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-03 14:38:21,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:26,178 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-03 14:38:26,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506696240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:26,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:26,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 26] total 46 [2025-03-03 14:38:26,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76006025] [2025-03-03 14:38:26,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:26,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 14:38:26,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:26,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 14:38:26,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1748, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 14:38:26,181 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-03 14:38:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:26,685 INFO L93 Difference]: Finished difference Result 159 states and 200 transitions. [2025-03-03 14:38:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 14:38:26,685 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-03 14:38:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:26,686 INFO L225 Difference]: With dead ends: 159 [2025-03-03 14:38:26,686 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 14:38:26,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 753 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=582, Invalid=3078, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 14:38:26,687 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 107 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:26,687 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.2s Time] [2025-03-03 14:38:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 14:38:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 14:38:26,695 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-03 14:38:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2025-03-03 14:38:26,696 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 393 [2025-03-03 14:38:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:26,696 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2025-03-03 14:38:26,696 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-03 14:38:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2025-03-03 14:38:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-03 14:38:26,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:26,702 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-03 14:38:26,710 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-03 14:38:26,906 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-03 14:38:26,906 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:26,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:26,906 INFO L85 PathProgramCache]: Analyzing trace with hash -111887509, now seen corresponding path program 3 times [2025-03-03 14:38:26,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:26,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243730855] [2025-03-03 14:38:26,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:26,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 597 statements into 15 equivalence classes. [2025-03-03 14:38:26,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 597 statements. [2025-03-03 14:38:26,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 14:38:26,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:27,180 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-03 14:38:27,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:27,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243730855] [2025-03-03 14:38:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243730855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162755265] [2025-03-03 14:38:27,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:27,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:27,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:27,183 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-03 14:38:27,184 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-03 14:38:27,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 597 statements into 15 equivalence classes. [2025-03-03 14:38:27,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 597 statements. [2025-03-03 14:38:27,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 14:38:27,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:27,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 14:38:27,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:27,475 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-03 14:38:27,601 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-03 14:38:27,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:29,703 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-03 14:38:29,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162755265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:29,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 28 [2025-03-03 14:38:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195657004] [2025-03-03 14:38:29,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:29,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:38:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:29,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:38:29,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:38:29,709 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-03 14:38:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:29,946 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2025-03-03 14:38:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:38:29,946 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-03 14:38:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:29,948 INFO L225 Difference]: With dead ends: 100 [2025-03-03 14:38:29,948 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 14:38:29,948 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-03 14:38:29,948 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-03 14:38:29,948 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-03 14:38:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 14:38:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 14:38:29,958 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-03 14:38:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2025-03-03 14:38:29,959 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 597 [2025-03-03 14:38:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:29,959 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2025-03-03 14:38:29,960 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-03 14:38:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2025-03-03 14:38:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1178 [2025-03-03 14:38:29,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:29,985 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-03 14:38:29,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:30,185 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-03 14:38:30,185 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:30,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash 392917444, now seen corresponding path program 4 times [2025-03-03 14:38:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:30,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214737661] [2025-03-03 14:38:30,186 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:38:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:30,247 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1177 statements into 2 equivalence classes. [2025-03-03 14:38:30,306 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1176 of 1177 statements. [2025-03-03 14:38:30,306 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:38:30,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:35,059 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-03 14:38:35,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:35,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214737661] [2025-03-03 14:38:35,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214737661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:35,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067336170] [2025-03-03 14:38:35,063 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:38:35,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:35,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:35,065 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-03 14:38:35,066 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-03 14:38:35,400 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1177 statements into 2 equivalence classes. [2025-03-03 14:38:35,787 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1176 of 1177 statements. [2025-03-03 14:38:35,787 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:38:35,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:35,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 5354 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 14:38:35,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:35,829 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-03 14:38:36,003 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-03 14:38:36,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:40,410 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-03 14:38:40,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067336170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:40,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:40,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 33 [2025-03-03 14:38:40,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974190670] [2025-03-03 14:38:40,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:40,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 14:38:40,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:40,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 14:38:40,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 14:38:40,412 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-03 14:38:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:40,782 INFO L93 Difference]: Finished difference Result 167 states and 204 transitions. [2025-03-03 14:38:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:38:40,783 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-03 14:38:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:40,784 INFO L225 Difference]: With dead ends: 167 [2025-03-03 14:38:40,784 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 14:38:40,784 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-03 14:38:40,785 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-03 14:38:40,785 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-03 14:38:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 14:38:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-03 14:38:40,790 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-03 14:38:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2025-03-03 14:38:40,790 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 1177 [2025-03-03 14:38:40,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:40,791 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2025-03-03 14:38:40,791 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-03 14:38:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2025-03-03 14:38:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2206 [2025-03-03 14:38:40,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:40,808 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-03 14:38:40,822 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-03 14:38:41,009 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-03 14:38:41,009 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:41,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1704646992, now seen corresponding path program 5 times [2025-03-03 14:38:41,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:41,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562708782] [2025-03-03 14:38:41,010 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:38:41,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:41,119 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2205 statements into 28 equivalence classes. [2025-03-03 14:38:43,075 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 1868 of 2205 statements. [2025-03-03 14:38:43,076 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-03 14:38:43,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat