./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+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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+nlh-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 e3035f98bbb3ff84987fa13edbd40518c4756dd57350bdb439e24cd050f366e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:24:19,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:24:19,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:24:19,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:24:19,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:24:19,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:24:19,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:24:19,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:24:19,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:24:19,352 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:24:19,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:24:19,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:24:19,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:24:19,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:24:19,354 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:24:19,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:24:19,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:24:19,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:24:19,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:24:19,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:24:19,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:24:19,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:24:19,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:24:19,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:24:19,359 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:24:19,359 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:24:19,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:24:19,359 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:24:19,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:24:19,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:24:19,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:24:19,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:24:19,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:24:19,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:24:19,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:24:19,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:24:19,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:24:19,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:24:19,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:24:19,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:24:19,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:24:19,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:24:19,362 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e3035f98bbb3ff84987fa13edbd40518c4756dd57350bdb439e24cd050f366e4 [2024-11-09 23:24:19,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:24:19,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:24:19,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:24:19,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:24:19,614 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:24:19,615 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+nlh-reducer.c [2024-11-09 23:24:20,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:24:20,946 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:24:20,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-11-09 23:24:20,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b891bb0/4c659710697c48f090a76ccfd287cdc8/FLAG96fc7c5a9 [2024-11-09 23:24:21,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52b891bb0/4c659710697c48f090a76ccfd287cdc8 [2024-11-09 23:24:21,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:24:21,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:24:21,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:24:21,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:24:21,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:24:21,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ba994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21, skipping insertion in model container [2024-11-09 23:24:21,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:24:21,534 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+nlh-reducer.c[2334,2347] [2024-11-09 23:24:21,543 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+nlh-reducer.c[3766,3779] [2024-11-09 23:24:21,546 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+nlh-reducer.c[5247,5260] [2024-11-09 23:24:21,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:24:21,560 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:24:21,575 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+nlh-reducer.c[2334,2347] [2024-11-09 23:24:21,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[3766,3779] [2024-11-09 23:24:21,580 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+nlh-reducer.c[5247,5260] [2024-11-09 23:24:21,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:24:21,603 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:24:21,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21 WrapperNode [2024-11-09 23:24:21,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:24:21,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:24:21,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:24:21,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:24:21,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,638 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2024-11-09 23:24:21,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:24:21,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:24:21,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:24:21,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:24:21,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,662 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 2 writes are split as follows [0, 1, 1]. [2024-11-09 23:24:21,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:24:21,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:24:21,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:24:21,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:24:21,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (1/1) ... [2024-11-09 23:24:21,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:24:21,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:24:21,699 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) [2024-11-09 23:24:21,706 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 [2024-11-09 23:24:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:24:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:24:21,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 23:24:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 23:24:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 23:24:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 23:24:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 23:24:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 23:24:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_22_0 [2024-11-09 23:24:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_22_0 [2024-11-09 23:24:21,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:24:21,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:24:21,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 23:24:21,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 23:24:21,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 23:24:21,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 23:24:21,871 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:24:21,873 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:24:22,046 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc main_~main____CPAchecker_TMP_0~0#1;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; [2024-11-09 23:24:22,046 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc main_~main____CPAchecker_TMP_0~0#1;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; [2024-11-09 23:24:22,046 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc main_~main____CPAchecker_TMP_0~0#1;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; [2024-11-09 23:24:22,046 INFO L1247 $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; [2024-11-09 23:24:22,046 INFO L1247 $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; [2024-11-09 23:24:22,046 INFO L1247 $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; [2024-11-09 23:24:22,047 INFO L1247 $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; [2024-11-09 23:24:22,047 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L175: 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; [2024-11-09 23:24:22,059 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-09 23:24:22,059 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:24:22,073 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:24:22,074 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:24:22,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:24:22 BoogieIcfgContainer [2024-11-09 23:24:22,075 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:24:22,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:24:22,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:24:22,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:24:22,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:24:21" (1/3) ... [2024-11-09 23:24:22,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583fd954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:24:22, skipping insertion in model container [2024-11-09 23:24:22,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:24:21" (2/3) ... [2024-11-09 23:24:22,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583fd954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:24:22, skipping insertion in model container [2024-11-09 23:24:22,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:24:22" (3/3) ... [2024-11-09 23:24:22,081 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-11-09 23:24:22,093 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:24:22,093 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 23:24:22,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:24:22,136 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;@5ebb28ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:24:22,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 23:24:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 36 states have (on average 1.5) internal successors, (54), 40 states have internal predecessors, (54), 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) [2024-11-09 23:24:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 23:24:22,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:22,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:22,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:22,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:22,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1665971313, now seen corresponding path program 1 times [2024-11-09 23:24:22,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:22,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884105774] [2024-11-09 23:24:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:24:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:24:22,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884105774] [2024-11-09 23:24:22,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884105774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:24:22,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:24:22,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:24:22,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516867473] [2024-11-09 23:24:22,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:24:22,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:24:22,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:22,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:24:22,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:24:22,410 INFO L87 Difference]: Start difference. First operand has 43 states, 36 states have (on average 1.5) internal successors, (54), 40 states have internal predecessors, (54), 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 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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) [2024-11-09 23:24:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:22,461 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2024-11-09 23:24:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:24:22,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 16 [2024-11-09 23:24:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:22,468 INFO L225 Difference]: With dead ends: 52 [2024-11-09 23:24:22,468 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 23:24:22,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:24:22,472 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:24:22,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:24:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 23:24:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-09 23:24:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.3125) internal successors, (42), 35 states have internal predecessors, (42), 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) [2024-11-09 23:24:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-09 23:24:22,497 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 16 [2024-11-09 23:24:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:22,498 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-09 23:24:22,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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) [2024-11-09 23:24:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-11-09 23:24:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 23:24:22,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:22,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:22,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:24:22,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:22,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1664988210, now seen corresponding path program 1 times [2024-11-09 23:24:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:22,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210461508] [2024-11-09 23:24:22,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:22,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:22,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:24:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:24:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210461508] [2024-11-09 23:24:22,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210461508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:24:22,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:24:22,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:24:22,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341249159] [2024-11-09 23:24:22,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:24:22,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:24:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:22,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:24:22,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:24:22,557 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-11-09 23:24:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:22,617 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-11-09 23:24:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:24:22,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2024-11-09 23:24:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:22,618 INFO L225 Difference]: With dead ends: 76 [2024-11-09 23:24:22,619 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 23:24:22,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:24:22,621 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:24:22,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 81 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:24:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 23:24:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2024-11-09 23:24:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 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), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:24:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-09 23:24:22,628 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 16 [2024-11-09 23:24:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:22,629 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-09 23:24:22,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-11-09 23:24:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-09 23:24:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 23:24:22,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:22,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:22,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:24:22,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:22,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash -102639793, now seen corresponding path program 1 times [2024-11-09 23:24:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:22,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340334088] [2024-11-09 23:24:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:22,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:22,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:24:22,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:24:22,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340334088] [2024-11-09 23:24:22,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340334088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:24:22,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:24:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:24:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430180102] [2024-11-09 23:24:22,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:24:22,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:24:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:24:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:24:22,715 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:24:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:22,767 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-11-09 23:24:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:24:22,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 23:24:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:22,769 INFO L225 Difference]: With dead ends: 70 [2024-11-09 23:24:22,770 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 23:24:22,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:24:22,772 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:24:22,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:24:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 23:24:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2024-11-09 23:24:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 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) [2024-11-09 23:24:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-09 23:24:22,778 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 17 [2024-11-09 23:24:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:22,778 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-09 23:24:22,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:24:22,779 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-09 23:24:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 23:24:22,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:22,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:22,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:24:22,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:22,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1199000540, now seen corresponding path program 1 times [2024-11-09 23:24:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:22,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905624956] [2024-11-09 23:24:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:22,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:24:23,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:24:23,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905624956] [2024-11-09 23:24:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905624956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:24:23,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:24:23,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:24:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132128282] [2024-11-09 23:24:23,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:24:23,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:24:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:23,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:24:23,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:24:23,017 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:24:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:23,073 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2024-11-09 23:24:23,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:24:23,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 23:24:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:23,074 INFO L225 Difference]: With dead ends: 60 [2024-11-09 23:24:23,074 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 23:24:23,075 INFO L431 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 [2024-11-09 23:24:23,077 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:24:23,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 162 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:24:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 23:24:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 23:24:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 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) [2024-11-09 23:24:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-09 23:24:23,083 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2024-11-09 23:24:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:23,084 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-09 23:24:23,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:24:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-09 23:24:23,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 23:24:23,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:23,085 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:23,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:24:23,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:23,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:23,086 INFO L85 PathProgramCache]: Analyzing trace with hash 151026647, now seen corresponding path program 1 times [2024-11-09 23:24:23,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:23,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664432792] [2024-11-09 23:24:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:23,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:23,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:24:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:24:23,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664432792] [2024-11-09 23:24:23,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664432792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:24:23,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309480627] [2024-11-09 23:24:23,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:23,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:24:23,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:24:23,481 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) [2024-11-09 23:24:23,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:24:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:23,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:24:23,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:24:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:24:23,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:24:23,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309480627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:24:23,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:24:23,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 23:24:23,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078214188] [2024-11-09 23:24:23,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:24:23,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:24:23,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:24:23,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:24:23,594 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) [2024-11-09 23:24:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:23,599 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-11-09 23:24:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:24:23,599 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), 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 22 [2024-11-09 23:24:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:23,600 INFO L225 Difference]: With dead ends: 44 [2024-11-09 23:24:23,600 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 23:24:23,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:24:23,601 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 65 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 [2024-11-09 23:24:23,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 65 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:24:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 23:24:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-09 23:24:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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) [2024-11-09 23:24:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-09 23:24:23,605 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 22 [2024-11-09 23:24:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:23,605 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-09 23:24:23,605 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), 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) [2024-11-09 23:24:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-09 23:24:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 23:24:23,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:23,606 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:23,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:24:23,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:24:23,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:23,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1794867796, now seen corresponding path program 1 times [2024-11-09 23:24:23,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:23,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877817357] [2024-11-09 23:24:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:23,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:24:23,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:24:23,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877817357] [2024-11-09 23:24:23,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877817357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:24:23,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:24:23,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:24:23,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844621289] [2024-11-09 23:24:23,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:24:23,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:24:23,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:23,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:24:23,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:24:23,899 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) 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) [2024-11-09 23:24:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:23,950 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-09 23:24:23,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:24:23,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) 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 28 [2024-11-09 23:24:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:23,952 INFO L225 Difference]: With dead ends: 39 [2024-11-09 23:24:23,952 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 23:24:23,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:24:23,953 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:24:23,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 175 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:24:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 23:24:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 23:24:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 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) [2024-11-09 23:24:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-09 23:24:23,959 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 28 [2024-11-09 23:24:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:23,959 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-09 23:24:23,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) 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) [2024-11-09 23:24:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-09 23:24:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 23:24:23,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:23,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:23,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:24:23,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:23,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1793884693, now seen corresponding path program 1 times [2024-11-09 23:24:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407346831] [2024-11-09 23:24:23,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:24,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:24,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:24:24,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:24:24,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407346831] [2024-11-09 23:24:24,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407346831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:24:24,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220830319] [2024-11-09 23:24:24,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:24,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:24:24,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:24:24,354 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) [2024-11-09 23:24:24,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:24:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:24,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 23:24:24,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:24:24,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 23:24:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:24:24,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:24:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:24:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220830319] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 23:24:25,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 23:24:25,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 12] total 22 [2024-11-09 23:24:25,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130754684] [2024-11-09 23:24:25,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:24:25,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:24:25,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:24:25,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2024-11-09 23:24:25,086 INFO L87 Difference]: Start difference. First operand 37 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) [2024-11-09 23:24:25,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:25,248 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2024-11-09 23:24:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:24:25,248 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 28 [2024-11-09 23:24:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:25,249 INFO L225 Difference]: With dead ends: 74 [2024-11-09 23:24:25,249 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 23:24:25,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2024-11-09 23:24:25,250 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:24:25,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 74 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:24:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 23:24:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2024-11-09 23:24:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 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) [2024-11-09 23:24:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-09 23:24:25,253 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 28 [2024-11-09 23:24:25,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:25,254 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-09 23:24:25,254 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) [2024-11-09 23:24:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-09 23:24:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 23:24:25,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:25,255 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:25,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:24:25,456 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,SelfDestructingSolverStorable6 [2024-11-09 23:24:25,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:25,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:25,457 INFO L85 PathProgramCache]: Analyzing trace with hash 196534181, now seen corresponding path program 1 times [2024-11-09 23:24:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:25,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547786172] [2024-11-09 23:24:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:25,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:25,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:25,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:24:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:24:25,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547786172] [2024-11-09 23:24:25,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547786172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:24:25,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996251060] [2024-11-09 23:24:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:25,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:24:25,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:24:25,755 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) [2024-11-09 23:24:25,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:24:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:25,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 23:24:25,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:24:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 23:24:25,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:24:25,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996251060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:24:25,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:24:25,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-09 23:24:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486569993] [2024-11-09 23:24:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:24:25,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:24:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:25,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:24:25,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:24:25,905 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) [2024-11-09 23:24:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:25,947 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2024-11-09 23:24:25,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:24:25,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 29 [2024-11-09 23:24:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:25,948 INFO L225 Difference]: With dead ends: 70 [2024-11-09 23:24:25,948 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 23:24:25,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:24:25,949 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:24:25,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 55 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:24:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 23:24:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2024-11-09 23:24:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 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) [2024-11-09 23:24:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-11-09 23:24:25,952 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2024-11-09 23:24:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:25,952 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-11-09 23:24:25,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) [2024-11-09 23:24:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-11-09 23:24:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 23:24:25,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:25,953 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:25,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:24:26,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:24:26,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:26,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1418497144, now seen corresponding path program 1 times [2024-11-09 23:24:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:26,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761899546] [2024-11-09 23:24:26,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:26,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:24:26,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:24:26,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761899546] [2024-11-09 23:24:26,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761899546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:24:26,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941312581] [2024-11-09 23:24:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:26,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:24:26,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:24:26,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:24:26,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:24:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:26,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 23:24:26,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:24:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:24:26,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:24:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:24:26,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941312581] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:24:26,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:24:26,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 23 [2024-11-09 23:24:26,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095558809] [2024-11-09 23:24:26,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:24:26,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 23:24:26,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:26,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 23:24:26,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:24:26,904 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 23 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 23:24:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:27,123 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2024-11-09 23:24:27,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:24:27,124 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-11-09 23:24:27,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:27,125 INFO L225 Difference]: With dead ends: 83 [2024-11-09 23:24:27,125 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 23:24:27,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2024-11-09 23:24:27,126 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:24:27,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 448 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:24:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 23:24:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-11-09 23:24:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 23:24:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-09 23:24:27,131 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 29 [2024-11-09 23:24:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:27,131 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-09 23:24:27,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 23:24:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-09 23:24:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 23:24:27,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:27,132 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:27,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 23:24:27,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:24:27,338 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:27,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash -795101117, now seen corresponding path program 2 times [2024-11-09 23:24:27,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:27,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628257997] [2024-11-09 23:24:27,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:27,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:27,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:28,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:28,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:28,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 23:24:28,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:24:28,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628257997] [2024-11-09 23:24:28,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628257997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:24:28,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029418671] [2024-11-09 23:24:28,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:24:28,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:24:28,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:24:28,533 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:24:28,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 23:24:28,665 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 23:24:28,665 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:24:28,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 23:24:28,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:24:29,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 23:24:29,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 23:24:29,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 23:24:29,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 23:24:29,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 23:24:29,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 23:24:29,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 306 treesize of output 153 [2024-11-09 23:24:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 23:24:29,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:24:29,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029418671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:24:29,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:24:29,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2024-11-09 23:24:29,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954279925] [2024-11-09 23:24:29,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:24:29,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:24:29,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:29,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:24:29,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2024-11-09 23:24:29,296 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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) [2024-11-09 23:24:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:29,512 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2024-11-09 23:24:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:24:29,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 44 [2024-11-09 23:24:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:29,513 INFO L225 Difference]: With dead ends: 64 [2024-11-09 23:24:29,513 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 23:24:29,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2024-11-09 23:24:29,513 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:24:29,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 68 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:24:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 23:24:29,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 23:24:29,514 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) [2024-11-09 23:24:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 23:24:29,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-11-09 23:24:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:29,514 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 23:24:29,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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) [2024-11-09 23:24:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 23:24:29,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 23:24:29,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-09 23:24:29,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-09 23:24:29,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-09 23:24:29,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 23:24:29,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 23:24:29,724 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:29,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 23:24:29,759 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:24:29,764 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_22_0 contained old-variable. Original clause: (and (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|)) Eliminated clause: true [2024-11-09 23:24:29,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:24:29 BoogieIcfgContainer [2024-11-09 23:24:29,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:24:29,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:24:29,772 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:24:29,772 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:24:29,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:24:22" (3/4) ... [2024-11-09 23:24:29,774 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 23:24:29,777 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_22_0 [2024-11-09 23:24:29,781 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-09 23:24:29,782 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 23:24:29,782 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 23:24:29,782 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 23:24:29,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:24:29,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 23:24:29,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:24:29,855 INFO L158 Benchmark]: Toolchain (without parser) took 8491.66ms. Allocated memory was 184.5MB in the beginning and 331.4MB in the end (delta: 146.8MB). Free memory was 132.9MB in the beginning and 194.9MB in the end (delta: -62.0MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2024-11-09 23:24:29,855 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory was 63.8MB in the beginning and 63.7MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:24:29,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.83ms. Allocated memory is still 184.5MB. Free memory was 132.9MB in the beginning and 118.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 23:24:29,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.86ms. Allocated memory is still 184.5MB. Free memory was 118.3MB in the beginning and 116.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:24:29,856 INFO L158 Benchmark]: Boogie Preprocessor took 29.99ms. Allocated memory is still 184.5MB. Free memory was 116.1MB in the beginning and 114.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:24:29,856 INFO L158 Benchmark]: IcfgBuilder took 405.74ms. Allocated memory is still 184.5MB. Free memory was 114.1MB in the beginning and 140.4MB in the end (delta: -26.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 23:24:29,856 INFO L158 Benchmark]: TraceAbstraction took 7695.08ms. Allocated memory was 184.5MB in the beginning and 331.4MB in the end (delta: 146.8MB). Free memory was 140.4MB in the beginning and 200.2MB in the end (delta: -59.7MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2024-11-09 23:24:29,857 INFO L158 Benchmark]: Witness Printer took 82.60ms. Allocated memory is still 331.4MB. Free memory was 200.2MB in the beginning and 194.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 23:24:29,858 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 100.7MB. Free memory was 63.8MB in the beginning and 63.7MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.83ms. Allocated memory is still 184.5MB. Free memory was 132.9MB in the beginning and 118.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.86ms. Allocated memory is still 184.5MB. Free memory was 118.3MB in the beginning and 116.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.99ms. Allocated memory is still 184.5MB. Free memory was 116.1MB in the beginning and 114.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 405.74ms. Allocated memory is still 184.5MB. Free memory was 114.1MB in the beginning and 140.4MB in the end (delta: -26.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7695.08ms. Allocated memory was 184.5MB in the beginning and 331.4MB in the end (delta: 146.8MB). Free memory was 140.4MB in the beginning and 200.2MB in the end (delta: -59.7MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. * Witness Printer took 82.60ms. Allocated memory is still 331.4MB. Free memory was 200.2MB in the beginning and 194.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 170]: 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, 43 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 1378 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1043 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 335 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=9, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 61 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 398 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 438 ConstructedInterpolants, 0 QuantifiedInterpolants, 2331 SizeOfPredicates, 24 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 78/136 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - ProcedureContractResult [Line: 36]: Procedure Contract for func_to_recursive_line_20_to_22_0 Derived contract for procedure func_to_recursive_line_20_to_22_0. Ensures: (((__return_main == \old(__return_main)) && (__tmp_155_0 == \old(__tmp_155_0))) && (__return_136 == \old(__return_136))) RESULT: Ultimate proved your program to be correct! [2024-11-09 23:24:29,879 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