./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.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-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.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 8639f60502701b783590428cddba5bf44f8c35f715b0b6bf93574efbde24283f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:37:09,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:37:09,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:37:09,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:37:09,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:37:09,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:37:09,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:37:09,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:37:09,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:37:09,762 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:37:09,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:37:09,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:37:09,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:37:09,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:37:09,764 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:37:09,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:37:09,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:37:09,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:37:09,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:37:09,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:37:09,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:37:09,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:37:09,766 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:37:09,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:37:09,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:37:09,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:37:09,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:37:09,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:37:09,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:37:09,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:37:09,766 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 -> 8639f60502701b783590428cddba5bf44f8c35f715b0b6bf93574efbde24283f [2025-03-03 14:37:09,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:37:09,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:37:09,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:37:09,979 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:37:09,980 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:37:09,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.c [2025-03-03 14:37:11,066 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c7d1151/189dd6d5f381443cb62a1229d2ca98f9/FLAG5fce56c5f [2025-03-03 14:37:11,305 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:37:11,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.c [2025-03-03 14:37:11,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c7d1151/189dd6d5f381443cb62a1229d2ca98f9/FLAG5fce56c5f [2025-03-03 14:37:11,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c7d1151/189dd6d5f381443cb62a1229d2ca98f9 [2025-03-03 14:37:11,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:37:11,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:37:11,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:37:11,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:37:11,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:37:11,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11, skipping insertion in model container [2025-03-03 14:37:11,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,673 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:37:11,781 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-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.c[2334,2347] [2025-03-03 14:37:11,792 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-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.c[3766,3779] [2025-03-03 14:37:11,795 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-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.c[5193,5206] [2025-03-03 14:37:11,798 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-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.c[7003,7016] [2025-03-03 14:37:11,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:37:11,811 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:37:11,825 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-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.c[2334,2347] [2025-03-03 14:37:11,829 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-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.c[3766,3779] [2025-03-03 14:37:11,832 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-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.c[5193,5206] [2025-03-03 14:37:11,834 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-crafted/recursified_simple_array_index_value_4.i.v+lhb-reducer.c[7003,7016] [2025-03-03 14:37:11,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:37:11,849 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:37:11,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11 WrapperNode [2025-03-03 14:37:11,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:37:11,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:37:11,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:37:11,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:37:11,857 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:37:11" (1/1) ... [2025-03-03 14:37:11,862 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:37:11" (1/1) ... [2025-03-03 14:37:11,873 INFO L138 Inliner]: procedures = 16, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 163 [2025-03-03 14:37:11,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:37:11,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:37:11,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:37:11,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:37:11,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,890 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-03 14:37:11,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:37:11,898 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:37:11,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:37:11,898 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:37:11,899 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11" (1/1) ... [2025-03-03 14:37:11,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:37:11,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:37:11,921 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:37:11,924 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:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 14:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:37:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_22_0 [2025-03-03 14:37:11,938 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_22_0 [2025-03-03 14:37:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:37:11,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:37:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:37:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:37:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:37:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 14:37:11,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:37:11,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:37:12,134 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1; [2025-03-03 14:37:12,136 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L172: havoc main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_4~0#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1; [2025-03-03 14:37:12,136 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_2~0#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-03 14:37:12,136 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: call ULTIMATE.dealloc(main_~#main__array~0#1.base, main_~#main__array~0#1.offset);havoc main_~#main__array~0#1.base, main_~#main__array~0#1.offset; [2025-03-03 14:37:12,136 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~main____CPAchecker_TMP_0~1#1; [2025-03-03 14:37:12,149 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 14:37:12,149 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:37:12,155 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:37:12,155 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:37:12,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:37:12 BoogieIcfgContainer [2025-03-03 14:37:12,155 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:37:12,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:37:12,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:37:12,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:37:12,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:37:11" (1/3) ... [2025-03-03 14:37:12,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6489275b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:37:12, skipping insertion in model container [2025-03-03 14:37:12,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:11" (2/3) ... [2025-03-03 14:37:12,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6489275b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:37:12, skipping insertion in model container [2025-03-03 14:37:12,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:37:12" (3/3) ... [2025-03-03 14:37:12,160 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i.v+lhb-reducer.c [2025-03-03 14:37:12,169 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:37:12,170 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_simple_array_index_value_4.i.v+lhb-reducer.c that has 2 procedures, 44 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-03 14:37:12,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:37:12,218 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;@36087b67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:37:12,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-03 14:37:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 41 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:37:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 14:37:12,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:12,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:37:12,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 14:37:12,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:12,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2004167927, now seen corresponding path program 1 times [2025-03-03 14:37:12,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:12,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968209508] [2025-03-03 14:37:12,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:12,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 14:37:12,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 14:37:12,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:12,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:12,609 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:37:12,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:12,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968209508] [2025-03-03 14:37:12,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968209508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:37:12,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:37:12,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:37:12,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459864890] [2025-03-03 14:37:12,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:37:12,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:37:12,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:12,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:37:12,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:37:12,632 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 41 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:37:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:12,702 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2025-03-03 14:37:12,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:37:12,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2025-03-03 14:37:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:12,709 INFO L225 Difference]: With dead ends: 82 [2025-03-03 14:37:12,709 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 14:37:12,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:37:12,714 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:37:12,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 258 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:37:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 14:37:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-03 14:37:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:37:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-03-03 14:37:12,741 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 15 [2025-03-03 14:37:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:12,741 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-03 14:37:12,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:37:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-03-03 14:37:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 14:37:12,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:12,742 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:37:12,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:37:12,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 14:37:12,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1988999492, now seen corresponding path program 1 times [2025-03-03 14:37:12,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:12,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667818216] [2025-03-03 14:37:12,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:12,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:12,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 14:37:12,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 14:37:12,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:12,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:37:13,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:13,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667818216] [2025-03-03 14:37:13,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667818216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:37:13,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201461295] [2025-03-03 14:37:13,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:13,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:37:13,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:37:13,118 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:37:13,120 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:37:13,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 14:37:13,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 14:37:13,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:13,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:13,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:37:13,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:37:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:37:13,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:37:13,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201461295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:37:13,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:37:13,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:37:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564336615] [2025-03-03 14:37:13,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:37:13,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:37:13,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:13,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:37:13,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:37:13,212 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:37:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:13,219 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-03 14:37:13,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:37:13,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-03-03 14:37:13,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:13,221 INFO L225 Difference]: With dead ends: 49 [2025-03-03 14:37:13,221 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 14:37:13,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:37:13,222 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:37:13,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 68 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:37:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 14:37:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-03-03 14:37:13,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:37:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-03-03 14:37:13,228 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 20 [2025-03-03 14:37:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:13,228 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-03-03 14:37:13,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:37:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-03-03 14:37:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 14:37:13,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:13,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:37:13,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:37:13,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:37:13,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 14:37:13,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:13,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1113366133, now seen corresponding path program 1 times [2025-03-03 14:37:13,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:13,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029213427] [2025-03-03 14:37:13,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:13,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:13,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 14:37:13,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 14:37:13,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:13,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:37:13,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:13,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029213427] [2025-03-03 14:37:13,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029213427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:37:13,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:37:13,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:37:13,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133885040] [2025-03-03 14:37:13,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:37:13,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:37:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:13,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:37:13,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:37:13,500 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:37:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:13,519 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-03-03 14:37:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:37:13,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-03 14:37:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:13,521 INFO L225 Difference]: With dead ends: 41 [2025-03-03 14:37:13,521 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 14:37:13,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:37:13,522 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:37:13,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:37:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 14:37:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-03 14:37:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:37:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-03-03 14:37:13,528 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 21 [2025-03-03 14:37:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:13,528 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-03-03 14:37:13,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:37:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2025-03-03 14:37:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 14:37:13,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:13,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:37:13,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:37:13,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 14:37:13,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1114349236, now seen corresponding path program 1 times [2025-03-03 14:37:13,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:13,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645510792] [2025-03-03 14:37:13,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:13,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:13,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 14:37:13,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 14:37:13,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:13,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:37:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:13,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645510792] [2025-03-03 14:37:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645510792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:37:13,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:37:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:37:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934708917] [2025-03-03 14:37:13,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:37:13,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:37:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:13,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:37:13,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:37:13,556 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:37:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:13,574 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-03-03 14:37:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:37:13,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-03 14:37:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:13,575 INFO L225 Difference]: With dead ends: 67 [2025-03-03 14:37:13,575 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 14:37:13,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:37:13,576 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 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:37:13,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:37:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 14:37:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2025-03-03 14:37:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.25) internal successors, (40), 35 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:37:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-03-03 14:37:13,581 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 21 [2025-03-03 14:37:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:13,581 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-03 14:37:13,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:37:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-03-03 14:37:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 14:37:13,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:13,582 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] [2025-03-03 14:37:13,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:37:13,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 14:37:13,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 157474957, now seen corresponding path program 1 times [2025-03-03 14:37:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763316183] [2025-03-03 14:37:13,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:13,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 14:37:13,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 14:37:13,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:13,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:37:13,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:13,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763316183] [2025-03-03 14:37:13,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763316183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:37:13,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:37:13,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:37:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606340896] [2025-03-03 14:37:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:37:13,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:37:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:13,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:37:13,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:37:13,618 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:37:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:13,638 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2025-03-03 14:37:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:37:13,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-03 14:37:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:13,639 INFO L225 Difference]: With dead ends: 61 [2025-03-03 14:37:13,639 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 14:37:13,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:37:13,640 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 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:37:13,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:37:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 14:37:13,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2025-03-03 14:37:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:37:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-03 14:37:13,643 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 22 [2025-03-03 14:37:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:13,643 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-03 14:37:13,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:37:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-03-03 14:37:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 14:37:13,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:13,644 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] [2025-03-03 14:37:13,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:37:13,644 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 14:37:13,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1166218859, now seen corresponding path program 1 times [2025-03-03 14:37:13,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:13,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133502037] [2025-03-03 14:37:13,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:13,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:13,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 14:37:13,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 14:37:13,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:13,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:37:13,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:13,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133502037] [2025-03-03 14:37:13,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133502037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:37:13,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629617344] [2025-03-03 14:37:13,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:13,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:37:13,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:37:13,938 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:37:13,939 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:37:13,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 14:37:14,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 14:37:14,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:14,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:14,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 14:37:14,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:37:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:37:14,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:37:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:37:14,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629617344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:37:14,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:37:14,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2025-03-03 14:37:14,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180060895] [2025-03-03 14:37:14,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:37:14,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:37:14,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:14,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:37:14,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:37:14,478 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 22 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 14:37:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:14,619 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-03-03 14:37:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:37:14,620 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2025-03-03 14:37:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:14,622 INFO L225 Difference]: With dead ends: 62 [2025-03-03 14:37:14,622 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 14:37:14,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:37:14,623 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:37:14,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 340 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:37:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 14:37:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-03 14:37:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:37:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-03 14:37:14,630 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 27 [2025-03-03 14:37:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:14,631 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-03 14:37:14,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 14:37:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-03-03 14:37:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:37:14,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:14,633 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:37:14,638 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:37:14,833 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,SelfDestructingSolverStorable5 [2025-03-03 14:37:14,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 14:37:14,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1874366597, now seen corresponding path program 2 times [2025-03-03 14:37:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:14,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15449690] [2025-03-03 14:37:14,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:37:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:14,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 14:37:14,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 37 statements. [2025-03-03 14:37:14,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:37:14,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:37:15,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:15,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15449690] [2025-03-03 14:37:15,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15449690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:37:15,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:37:15,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:37:15,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474687241] [2025-03-03 14:37:15,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:37:15,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:37:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:15,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:37:15,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:37:15,808 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:37:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:15,940 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-03-03 14:37:15,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:37:15,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-03-03 14:37:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:15,941 INFO L225 Difference]: With dead ends: 56 [2025-03-03 14:37:15,941 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 14:37:15,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:37:15,941 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:37:15,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 85 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:37:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 14:37:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2025-03-03 14:37:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 33 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:37:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-03-03 14:37:15,947 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 37 [2025-03-03 14:37:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:15,947 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-03-03 14:37:15,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:37:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-03-03 14:37:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 14:37:15,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:15,947 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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:37:15,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:37:15,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 14:37:15,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:15,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1737335259, now seen corresponding path program 1 times [2025-03-03 14:37:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:15,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798923600] [2025-03-03 14:37:15,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:15,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:15,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 14:37:15,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 14:37:15,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:15,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:37:16,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:16,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798923600] [2025-03-03 14:37:16,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798923600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:37:16,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:37:16,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:37:16,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131955789] [2025-03-03 14:37:16,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:37:16,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:37:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:16,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:37:16,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:37:16,022 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:37:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:16,046 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-03-03 14:37:16,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:37:16,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-03-03 14:37:16,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:16,047 INFO L225 Difference]: With dead ends: 39 [2025-03-03 14:37:16,047 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 14:37:16,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:37:16,048 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:37:16,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:37:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 14:37:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-03 14:37:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:37:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2025-03-03 14:37:16,053 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 38 [2025-03-03 14:37:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:16,053 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2025-03-03 14:37:16,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:37:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2025-03-03 14:37:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 14:37:16,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:16,054 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 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:37:16,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:37:16,054 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-03 14:37:16,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:16,054 INFO L85 PathProgramCache]: Analyzing trace with hash 386529438, now seen corresponding path program 1 times [2025-03-03 14:37:16,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:16,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64905397] [2025-03-03 14:37:16,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:16,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:16,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 14:37:16,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 14:37:16,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:16,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:37:16,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:16,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64905397] [2025-03-03 14:37:16,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64905397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:37:16,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237127682] [2025-03-03 14:37:16,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:16,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:37:16,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:37:16,605 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:37:16,607 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:37:16,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 14:37:16,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 14:37:16,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:16,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:16,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:37:16,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:37:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:37:16,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:37:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:37:16,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237127682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:37:16,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:37:16,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 17 [2025-03-03 14:37:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202983473] [2025-03-03 14:37:16,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:37:16,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 14:37:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:16,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 14:37:16,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:37:16,896 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 17 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 14:37:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:17,161 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2025-03-03 14:37:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:37:17,161 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2025-03-03 14:37:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:17,162 INFO L225 Difference]: With dead ends: 61 [2025-03-03 14:37:17,162 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:37:17,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:37:17,164 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:37:17,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 172 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:37:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:37:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:37:17,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:37:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:37:17,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-03-03 14:37:17,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:17,165 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:37:17,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 14:37:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:37:17,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:37:17,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-03 14:37:17,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-03 14:37:17,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-03 14:37:17,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-03 14:37:17,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:37:17,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:37:17,371 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:37:17,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:37:17,394 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:37:17,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:37:17 BoogieIcfgContainer [2025-03-03 14:37:17,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:37:17,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:37:17,398 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:37:17,398 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:37:17,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:37:12" (3/4) ... [2025-03-03 14:37:17,400 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:37:17,404 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_22_0 [2025-03-03 14:37:17,407 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-03 14:37:17,407 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-03 14:37:17,408 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 14:37:17,408 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:37:17,471 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:37:17,471 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:37:17,471 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:37:17,472 INFO L158 Benchmark]: Toolchain (without parser) took 5821.48ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 121.2MB in the beginning and 163.4MB in the end (delta: -42.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 14:37:17,472 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:37:17,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.36ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 108.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:37:17,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.62ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 106.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:37:17,472 INFO L158 Benchmark]: Boogie Preprocessor took 23.73ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 105.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:37:17,473 INFO L158 Benchmark]: IcfgBuilder took 256.99ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 88.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:37:17,473 INFO L158 Benchmark]: TraceAbstraction took 5241.56ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 87.4MB in the beginning and 168.7MB in the end (delta: -81.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:37:17,473 INFO L158 Benchmark]: Witness Printer took 73.06ms. Allocated memory is still 251.7MB. Free memory was 168.7MB in the beginning and 163.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:37:17,476 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.36ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 108.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.62ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 106.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.73ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 105.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 256.99ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 88.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5241.56ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 87.4MB in the beginning and 168.7MB in the end (delta: -81.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 73.06ms. Allocated memory is still 251.7MB. Free memory was 168.7MB in the beginning and 163.4MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 125]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 167]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 233]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 1279 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 969 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 443 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 310 mSDtfsCounter, 443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 328 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 2598 SizeOfPredicates, 7 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 143/173 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 14:37:17,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE