./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d 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-simple/recursified_nested_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 04:59:26,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 04:59:26,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-17 04:59:26,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 04:59:26,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 04:59:26,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 04:59:26,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 04:59:26,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 04:59:26,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 04:59:26,750 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 04:59:26,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 04:59:26,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 04:59:26,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 04:59:26,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 04:59:26,753 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 04:59:26,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 04:59:26,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 04:59:26,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 04:59:26,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 04:59:26,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 04:59:26,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 04:59:26,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 04:59:26,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 04:59:26,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 04:59:26,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 04:59:26,755 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 04:59:26,756 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 04:59:26,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 04:59:26,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 04:59:26,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 04:59:26,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 04:59:26,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 04:59:26,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 04:59:26,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 04:59:26,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:59:26,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 04:59:26,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 04:59:26,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 04:59:26,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 04:59:26,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 04:59:26,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 04:59:26,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 04:59:26,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 04:59:26,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 04:59:26,760 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 ! overflow) ) 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2024-11-17 04:59:26,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 04:59:26,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 04:59:26,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 04:59:26,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 04:59:26,970 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 04:59:26,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-11-17 04:59:28,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 04:59:28,377 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 04:59:28,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-11-17 04:59:28,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b3cceca/0060b7a31965482d8e2124106ef2cad2/FLAGebe478801 [2024-11-17 04:59:28,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b3cceca/0060b7a31965482d8e2124106ef2cad2 [2024-11-17 04:59:28,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 04:59:28,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 04:59:28,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 04:59:28,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 04:59:28,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 04:59:28,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275b10c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28, skipping insertion in model container [2024-11-17 04:59:28,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 04:59:28,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:59:28,574 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 04:59:28,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 04:59:28,600 INFO L204 MainTranslator]: Completed translation [2024-11-17 04:59:28,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28 WrapperNode [2024-11-17 04:59:28,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 04:59:28,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 04:59:28,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 04:59:28,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 04:59:28,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,623 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-11-17 04:59:28,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 04:59:28,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 04:59:28,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 04:59:28,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 04:59:28,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,642 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 6, 6, 6]. 30 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 6 writes are split as follows [0, 2, 2, 2]. [2024-11-17 04:59:28,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 04:59:28,650 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 04:59:28,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 04:59:28,650 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 04:59:28,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (1/1) ... [2024-11-17 04:59:28,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 04:59:28,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:59:28,675 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-17 04:59:28,678 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-17 04:59:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 04:59:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 04:59:28,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 04:59:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 04:59:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-17 04:59:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 04:59:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 04:59:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 04:59:28,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 04:59:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-17 04:59:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2024-11-17 04:59:28,717 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2024-11-17 04:59:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-17 04:59:28,717 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-17 04:59:28,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 04:59:28,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 04:59:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 04:59:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 04:59:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 04:59:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-17 04:59:28,718 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2024-11-17 04:59:28,718 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2024-11-17 04:59:28,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 04:59:28,812 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 04:59:28,814 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 04:59:28,946 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2024-11-17 04:59:28,985 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-17 04:59:28,985 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 04:59:29,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 04:59:29,000 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 04:59:29,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:59:29 BoogieIcfgContainer [2024-11-17 04:59:29,001 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 04:59:29,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 04:59:29,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 04:59:29,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 04:59:29,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:59:28" (1/3) ... [2024-11-17 04:59:29,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb83a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:59:29, skipping insertion in model container [2024-11-17 04:59:29,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:59:28" (2/3) ... [2024-11-17 04:59:29,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb83a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:59:29, skipping insertion in model container [2024-11-17 04:59:29,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:59:29" (3/3) ... [2024-11-17 04:59:29,010 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2024-11-17 04:59:29,023 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 04:59:29,023 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-17 04:59:29,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 04:59:29,083 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;@39441698, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 04:59:29,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 04:59:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 40 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 04:59:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 04:59:29,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:29,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:29,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:29,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:29,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1858630252, now seen corresponding path program 1 times [2024-11-17 04:59:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:29,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509075368] [2024-11-17 04:59:29,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:29,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:29,534 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-17 04:59:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509075368] [2024-11-17 04:59:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509075368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:29,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 04:59:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022874204] [2024-11-17 04:59:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:29,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:59:29,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:59:29,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:59:29,560 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 40 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:29,653 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2024-11-17 04:59:29,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:59:29,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-17 04:59:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:29,661 INFO L225 Difference]: With dead ends: 96 [2024-11-17 04:59:29,661 INFO L226 Difference]: Without dead ends: 41 [2024-11-17 04:59:29,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-17 04:59:29,667 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:29,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 221 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:59:29,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-17 04:59:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-17 04:59:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 31 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 04:59:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-17 04:59:29,693 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 12 [2024-11-17 04:59:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:29,693 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-17 04:59:29,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:29,694 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-17 04:59:29,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 04:59:29,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:29,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:29,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 04:59:29,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:29,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:29,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1782962992, now seen corresponding path program 1 times [2024-11-17 04:59:29,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:29,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239040196] [2024-11-17 04:59:29,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:29,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:29,760 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-17 04:59:29,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:29,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239040196] [2024-11-17 04:59:29,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239040196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:29,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:29,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 04:59:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829514375] [2024-11-17 04:59:29,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:29,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 04:59:29,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:29,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 04:59:29,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 04:59:29,765 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:29,786 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-17 04:59:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 04:59:29,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 04:59:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:29,787 INFO L225 Difference]: With dead ends: 38 [2024-11-17 04:59:29,788 INFO L226 Difference]: Without dead ends: 37 [2024-11-17 04:59:29,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-17 04:59:29,789 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:29,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:59:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-17 04:59:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-17 04:59:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 04:59:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-17 04:59:29,794 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 13 [2024-11-17 04:59:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:29,794 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-17 04:59:29,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-17 04:59:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 04:59:29,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:29,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:29,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 04:59:29,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:29,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:29,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1858666483, now seen corresponding path program 1 times [2024-11-17 04:59:29,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:29,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906870763] [2024-11-17 04:59:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:29,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:29,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:29,926 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-17 04:59:29,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:29,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906870763] [2024-11-17 04:59:29,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906870763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:29,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:29,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 04:59:29,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138312405] [2024-11-17 04:59:29,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:29,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:59:29,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:29,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:59:29,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:59:29,931 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:59:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:30,071 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-17 04:59:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:59:30,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-17 04:59:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:30,074 INFO L225 Difference]: With dead ends: 75 [2024-11-17 04:59:30,074 INFO L226 Difference]: Without dead ends: 41 [2024-11-17 04:59:30,074 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-17 04:59:30,075 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:30,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 93 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:59:30,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-17 04:59:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-17 04:59:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 32 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 04:59:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-11-17 04:59:30,087 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 12 [2024-11-17 04:59:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:30,087 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-17 04:59:30,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 04:59:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-11-17 04:59:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 04:59:30,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:30,088 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:30,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 04:59:30,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:30,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:30,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1101207098, now seen corresponding path program 1 times [2024-11-17 04:59:30,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:30,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342709186] [2024-11-17 04:59:30,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:30,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 04:59:30,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342709186] [2024-11-17 04:59:30,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342709186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:30,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:30,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 04:59:30,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967937367] [2024-11-17 04:59:30,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:30,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 04:59:30,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:30,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 04:59:30,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:59:30,247 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:30,323 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-17 04:59:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 04:59:30,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-17 04:59:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:30,325 INFO L225 Difference]: With dead ends: 46 [2024-11-17 04:59:30,326 INFO L226 Difference]: Without dead ends: 45 [2024-11-17 04:59:30,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:59:30,328 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:30,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:59:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-17 04:59:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2024-11-17 04:59:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.24) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-17 04:59:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-17 04:59:30,338 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2024-11-17 04:59:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:30,338 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-17 04:59:30,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 04:59:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-17 04:59:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 04:59:30,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:30,339 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] [2024-11-17 04:59:30,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 04:59:30,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:30,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:30,339 INFO L85 PathProgramCache]: Analyzing trace with hash 80187769, now seen corresponding path program 1 times [2024-11-17 04:59:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:30,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100780141] [2024-11-17 04:59:30,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:30,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:59:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,457 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-17 04:59:30,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:30,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100780141] [2024-11-17 04:59:30,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100780141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:30,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:30,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 04:59:30,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187676887] [2024-11-17 04:59:30,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:30,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 04:59:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:30,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 04:59:30,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:59:30,461 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:59:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:30,561 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-11-17 04:59:30,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 04:59:30,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-17 04:59:30,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:30,562 INFO L225 Difference]: With dead ends: 50 [2024-11-17 04:59:30,562 INFO L226 Difference]: Without dead ends: 46 [2024-11-17 04:59:30,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-17 04:59:30,563 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:30,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 138 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:59:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-17 04:59:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-11-17 04:59:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 04:59:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-11-17 04:59:30,568 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 23 [2024-11-17 04:59:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:30,568 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-11-17 04:59:30,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 04:59:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-11-17 04:59:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 04:59:30,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:30,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:30,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 04:59:30,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:30,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1604606010, now seen corresponding path program 1 times [2024-11-17 04:59:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:30,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781375470] [2024-11-17 04:59:30,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-17 04:59:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 04:59:30,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:30,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781375470] [2024-11-17 04:59:30,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781375470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:30,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:30,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 04:59:30,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851105105] [2024-11-17 04:59:30,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:30,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 04:59:30,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:30,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 04:59:30,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-17 04:59:30,714 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 04:59:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:30,819 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-11-17 04:59:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 04:59:30,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-17 04:59:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:30,821 INFO L225 Difference]: With dead ends: 54 [2024-11-17 04:59:30,821 INFO L226 Difference]: Without dead ends: 52 [2024-11-17 04:59:30,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-17 04:59:30,822 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:30,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 118 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:59:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-17 04:59:30,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-17 04:59:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 38 states have internal predecessors, (41), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-17 04:59:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-17 04:59:30,832 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2024-11-17 04:59:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:30,832 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-17 04:59:30,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 04:59:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-11-17 04:59:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-17 04:59:30,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:30,833 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:30,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 04:59:30,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:30,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:30,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1910328769, now seen corresponding path program 1 times [2024-11-17 04:59:30,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:30,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988731026] [2024-11-17 04:59:30,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:30,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:59:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-17 04:59:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-17 04:59:31,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:31,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988731026] [2024-11-17 04:59:31,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988731026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:59:31,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415117405] [2024-11-17 04:59:31,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:31,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:31,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:59:31,193 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-17 04:59:31,194 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-17 04:59:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 04:59:31,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:59:31,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 04:59:31,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2024-11-17 04:59:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-17 04:59:31,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 04:59:31,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415117405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:31,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 04:59:31,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2024-11-17 04:59:31,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583312284] [2024-11-17 04:59:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:31,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 04:59:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:31,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 04:59:31,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-17 04:59:31,482 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:59:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:31,578 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-11-17 04:59:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 04:59:31,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2024-11-17 04:59:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:31,579 INFO L225 Difference]: With dead ends: 55 [2024-11-17 04:59:31,579 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 04:59:31,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-17 04:59:31,580 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:31,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 98 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:59:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 04:59:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-11-17 04:59:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-17 04:59:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-17 04:59:31,593 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 43 [2024-11-17 04:59:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:31,593 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-17 04:59:31,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-17 04:59:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-17 04:59:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-17 04:59:31,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:31,596 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:31,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 04:59:31,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:31,797 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:31,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -909350323, now seen corresponding path program 1 times [2024-11-17 04:59:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:31,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509064809] [2024-11-17 04:59:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:31,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 04:59:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-17 04:59:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-17 04:59:31,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:31,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509064809] [2024-11-17 04:59:31,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509064809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:31,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:31,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 04:59:31,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047000224] [2024-11-17 04:59:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 04:59:31,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:31,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 04:59:31,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 04:59:31,882 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:59:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:31,931 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-17 04:59:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 04:59:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-11-17 04:59:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:31,932 INFO L225 Difference]: With dead ends: 50 [2024-11-17 04:59:31,934 INFO L226 Difference]: Without dead ends: 49 [2024-11-17 04:59:31,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-17 04:59:31,935 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:31,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 104 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:59:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-17 04:59:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-11-17 04:59:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 04:59:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-11-17 04:59:31,942 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 44 [2024-11-17 04:59:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:31,943 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-11-17 04:59:31,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 04:59:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-11-17 04:59:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-17 04:59:31,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:31,944 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:31,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 04:59:31,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:31,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1992368440, now seen corresponding path program 1 times [2024-11-17 04:59:31,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:31,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638073050] [2024-11-17 04:59:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:32,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:32,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:32,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:32,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-17 04:59:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:32,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-17 04:59:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:32,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:32,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-17 04:59:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-17 04:59:32,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:32,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638073050] [2024-11-17 04:59:32,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638073050] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:59:32,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812806404] [2024-11-17 04:59:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:32,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:32,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:59:32,358 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-17 04:59:32,359 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-17 04:59:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:32,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-17 04:59:32,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:59:32,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 04:59:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-17 04:59:32,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:59:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-17 04:59:33,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812806404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:59:33,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:59:33,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 26 [2024-11-17 04:59:33,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568945828] [2024-11-17 04:59:33,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:59:33,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 04:59:33,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:33,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 04:59:33,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2024-11-17 04:59:33,150 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 26 states, 20 states have (on average 3.4) internal successors, (68), 22 states have internal predecessors, (68), 8 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-17 04:59:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:33,393 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2024-11-17 04:59:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 04:59:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 3.4) internal successors, (68), 22 states have internal predecessors, (68), 8 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15) Word has length 68 [2024-11-17 04:59:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:33,395 INFO L225 Difference]: With dead ends: 88 [2024-11-17 04:59:33,395 INFO L226 Difference]: Without dead ends: 49 [2024-11-17 04:59:33,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2024-11-17 04:59:33,396 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:33,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 226 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 04:59:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-17 04:59:33,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-17 04:59:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-17 04:59:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2024-11-17 04:59:33,402 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 68 [2024-11-17 04:59:33,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:33,402 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-11-17 04:59:33,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 3.4) internal successors, (68), 22 states have internal predecessors, (68), 8 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-17 04:59:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2024-11-17 04:59:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-17 04:59:33,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:33,403 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:33,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-17 04:59:33,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-17 04:59:33,608 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:33,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1528746780, now seen corresponding path program 2 times [2024-11-17 04:59:33,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:33,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412860774] [2024-11-17 04:59:33,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:33,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:33,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-17 04:59:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-17 04:59:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-17 04:59:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 15 proven. 109 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-17 04:59:34,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:34,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412860774] [2024-11-17 04:59:34,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412860774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:59:34,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113452653] [2024-11-17 04:59:34,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 04:59:34,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:34,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:59:34,404 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-17 04:59:34,406 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-17 04:59:34,509 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 04:59:34,510 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 04:59:34,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-17 04:59:34,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:59:34,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 04:59:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 110 proven. 15 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-17 04:59:34,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:59:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 5 proven. 146 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-17 04:59:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113452653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:59:36,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:59:36,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 21] total 40 [2024-11-17 04:59:36,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230174298] [2024-11-17 04:59:36,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:59:36,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-17 04:59:36,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:36,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-17 04:59:36,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2024-11-17 04:59:36,265 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 40 states, 31 states have (on average 2.870967741935484) internal successors, (89), 34 states have internal predecessors, (89), 11 states have call successors, (26), 8 states have call predecessors, (26), 11 states have return successors, (23), 9 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-17 04:59:36,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:36,601 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-11-17 04:59:36,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 04:59:36,601 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 31 states have (on average 2.870967741935484) internal successors, (89), 34 states have internal predecessors, (89), 11 states have call successors, (26), 8 states have call predecessors, (26), 11 states have return successors, (23), 9 states have call predecessors, (23), 11 states have call successors, (23) Word has length 100 [2024-11-17 04:59:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:36,602 INFO L225 Difference]: With dead ends: 96 [2024-11-17 04:59:36,602 INFO L226 Difference]: Without dead ends: 53 [2024-11-17 04:59:36,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2024-11-17 04:59:36,603 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:36,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 289 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 04:59:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-17 04:59:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-17 04:59:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 7 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-17 04:59:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-17 04:59:36,610 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 100 [2024-11-17 04:59:36,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:36,610 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-17 04:59:36,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 31 states have (on average 2.870967741935484) internal successors, (89), 34 states have internal predecessors, (89), 11 states have call successors, (26), 8 states have call predecessors, (26), 11 states have return successors, (23), 9 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-17 04:59:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-17 04:59:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-17 04:59:36,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:36,612 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 10, 10, 10, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:36,624 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-17 04:59:36,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:36,812 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:36,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1812216576, now seen corresponding path program 3 times [2024-11-17 04:59:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:36,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735506604] [2024-11-17 04:59:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:37,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:37,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:37,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:37,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:38,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:38,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:59:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:38,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-17 04:59:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:38,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:38,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:38,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:38,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:38,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:38,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:38,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-17 04:59:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 25 proven. 253 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-17 04:59:38,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:38,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735506604] [2024-11-17 04:59:38,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735506604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:59:38,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395655361] [2024-11-17 04:59:38,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 04:59:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:38,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:59:38,151 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-17 04:59:38,152 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-17 04:59:38,258 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 04:59:38,258 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 04:59:38,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-17 04:59:38,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:59:38,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 04:59:38,474 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-17 04:59:38,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:59:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-17 04:59:38,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395655361] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:59:38,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:59:38,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 11] total 36 [2024-11-17 04:59:38,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836968763] [2024-11-17 04:59:38,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:59:38,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-17 04:59:38,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:38,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-17 04:59:38,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2024-11-17 04:59:38,946 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 36 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 31 states have internal predecessors, (79), 12 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-17 04:59:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:39,375 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2024-11-17 04:59:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 04:59:39,376 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 31 states have internal predecessors, (79), 12 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) Word has length 132 [2024-11-17 04:59:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:39,377 INFO L225 Difference]: With dead ends: 104 [2024-11-17 04:59:39,378 INFO L226 Difference]: Without dead ends: 57 [2024-11-17 04:59:39,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=319, Invalid=2131, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 04:59:39,379 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:39,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 215 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 04:59:39,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-17 04:59:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-17 04:59:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 10 states have return successors, (13), 11 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-17 04:59:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-11-17 04:59:39,390 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 132 [2024-11-17 04:59:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:39,390 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-11-17 04:59:39,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 31 states have internal predecessors, (79), 12 states have call successors, (22), 7 states have call predecessors, (22), 12 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-17 04:59:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-11-17 04:59:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-17 04:59:39,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:39,394 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:39,406 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-17 04:59:39,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:39,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:39,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:39,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1587305274, now seen corresponding path program 4 times [2024-11-17 04:59:39,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:39,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837436651] [2024-11-17 04:59:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:39,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:39,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:39,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:39,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:39,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:39,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-17 04:59:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-17 04:59:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-17 04:59:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-17 04:59:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-17 04:59:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2712 trivial. 0 not checked. [2024-11-17 04:59:40,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837436651] [2024-11-17 04:59:40,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837436651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 04:59:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551559004] [2024-11-17 04:59:40,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 04:59:40,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 04:59:40,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 04:59:40,121 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-17 04:59:40,122 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-17 04:59:40,291 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 04:59:40,292 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 04:59:40,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-17 04:59:40,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 04:59:40,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 04:59:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 2646 trivial. 0 not checked. [2024-11-17 04:59:40,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 04:59:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 2636 trivial. 0 not checked. [2024-11-17 04:59:41,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551559004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 04:59:41,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 04:59:41,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 16] total 34 [2024-11-17 04:59:41,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860978680] [2024-11-17 04:59:41,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 04:59:41,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-17 04:59:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:41,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-17 04:59:41,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2024-11-17 04:59:41,386 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 34 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 26 states have internal predecessors, (68), 12 states have call successors, (21), 9 states have call predecessors, (21), 7 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-17 04:59:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:41,884 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2024-11-17 04:59:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-17 04:59:41,885 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 26 states have internal predecessors, (68), 12 states have call successors, (21), 9 states have call predecessors, (21), 7 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Word has length 272 [2024-11-17 04:59:41,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:41,885 INFO L225 Difference]: With dead ends: 111 [2024-11-17 04:59:41,886 INFO L226 Difference]: Without dead ends: 60 [2024-11-17 04:59:41,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1861, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 04:59:41,887 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 53 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:41,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 89 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 04:59:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-17 04:59:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-17 04:59:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 7 states have call successors, (7), 6 states have call predecessors, (7), 11 states have return successors, (14), 12 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-17 04:59:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2024-11-17 04:59:41,894 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 272 [2024-11-17 04:59:41,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:41,894 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2024-11-17 04:59:41,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 26 states have internal predecessors, (68), 12 states have call successors, (21), 9 states have call predecessors, (21), 7 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-17 04:59:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2024-11-17 04:59:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-17 04:59:41,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 04:59:41,897 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 36, 36, 36, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:41,911 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-17 04:59:42,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-17 04:59:42,098 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-11-17 04:59:42,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 04:59:42,098 INFO L85 PathProgramCache]: Analyzing trace with hash 634434957, now seen corresponding path program 1 times [2024-11-17 04:59:42,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 04:59:42,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847611336] [2024-11-17 04:59:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 04:59:42,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 04:59:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-17 04:59:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-17 04:59:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-17 04:59:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-11-17 04:59:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-17 04:59:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-17 04:59:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 04:59:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-17 04:59:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-17 04:59:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 04:59:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6172 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6167 trivial. 0 not checked. [2024-11-17 04:59:42,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 04:59:42,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847611336] [2024-11-17 04:59:42,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847611336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 04:59:42,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 04:59:42,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 04:59:42,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504677536] [2024-11-17 04:59:42,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 04:59:42,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 04:59:42,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 04:59:42,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 04:59:42,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 04:59:42,577 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-17 04:59:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 04:59:42,641 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-17 04:59:42,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 04:59:42,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 397 [2024-11-17 04:59:42,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 04:59:42,642 INFO L225 Difference]: With dead ends: 58 [2024-11-17 04:59:42,642 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 04:59:42,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-17 04:59:42,644 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 04:59:42,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 78 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 04:59:42,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 04:59:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 04:59:42,645 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-17 04:59:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 04:59:42,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 397 [2024-11-17 04:59:42,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 04:59:42,646 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 04:59:42,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-17 04:59:42,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 04:59:42,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 04:59:42,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-17 04:59:42,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-17 04:59:42,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-17 04:59:42,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-17 04:59:42,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-17 04:59:42,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_22_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-17 04:59:42,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 04:59:42,651 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 04:59:42,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-17 05:00:07,099 WARN L286 SmtUtils]: Spent 24.10s on a formula simplification. DAG size of input: 77 DAG size of output: 18 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-17 05:00:19,154 WARN L286 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 46 DAG size of output: 35 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-17 05:00:35,258 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification. DAG size of input: 63 DAG size of output: 18 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-17 05:00:35,319 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 05:00:35,325 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_23_to_23_0 contained old-variable. Original clause: (and (exists ((v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#1| v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2) 2147483648))) (<= 0 (+ (select (select |old(#memory_int#3)| |func_to_recursive_line_23_to_23_0_#in~c.base|) |func_to_recursive_line_23_to_23_0_#in~c.offset|) 2147483648)) (= |#memory_int#3| |old(#memory_int#3)|)) Eliminated clause: (and (exists ((v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#1| v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2) 2147483648))) (<= 0 (+ (select (select |#memory_int#3| |func_to_recursive_line_23_to_23_0_#in~c.base|) |func_to_recursive_line_23_to_23_0_#in~c.offset|) 2147483648))) [2024-11-17 05:00:35,330 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 05:00:35,332 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-17 05:00:35,332 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-17 05:00:35,332 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-11-17 05:00:35,333 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 05:00:35,333 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-17 05:00:35,333 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2024-11-17 05:00:35,333 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~c!base,]]] [2024-11-17 05:00:35,335 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_22_to_23_0 contained old-variable. Original clause: (and (<= 0 (+ 2147483648 (select (select |old(#memory_int#1)| |func_to_recursive_line_22_to_23_0_#in~b.base|) |func_to_recursive_line_22_to_23_0_#in~b.offset|))) (= |#memory_int#1| |old(#memory_int#1)|) (= |#memory_int#3| |old(#memory_int#3)|)) Eliminated clause: (<= 0 (+ (select (select |#memory_int#1| |func_to_recursive_line_22_to_23_0_#in~b.base|) |func_to_recursive_line_22_to_23_0_#in~b.offset|) 2147483648)) [2024-11-17 05:00:35,335 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 05:00:35,336 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-17 05:00:35,336 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-17 05:00:35,336 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 05:00:35,336 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-17 05:00:35,336 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-11-17 05:00:35,336 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-17 05:00:35,338 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_21_to_22_0 contained old-variable. Original clause: (let ((.cse3 (select (select |old(#memory_int#2)| |func_to_recursive_line_21_to_22_0_#in~a.base|) |func_to_recursive_line_21_to_22_0_#in~a.offset|))) (let ((.cse4 (= .cse3 0)) (.cse1 (= |#memory_int#1| |old(#memory_int#1)|)) (.cse2 (= |#memory_int#3| |old(#memory_int#3)|)) (.cse0 (select (select |#memory_int#2| |func_to_recursive_line_21_to_22_0_#in~a.base|) |func_to_recursive_line_21_to_22_0_#in~a.offset|))) (and (or (and (<= 1 .cse0) .cse1 .cse2) (< .cse3 1)) (let ((.cse5 (exists ((v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |old(#memory_int#1)| v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2) 2147483648))))) (or (and .cse4 .cse5) (and .cse5 (<= 1 .cse3)))) (or (not .cse4) (and .cse1 .cse2 (= .cse0 0)))))) Eliminated clause: (exists ((|old(#memory_int#1)| (Array Int (Array Int Int))) (|old(#memory_int#3)| (Array Int (Array Int Int))) (|old(#memory_int#2)| (Array Int (Array Int Int)))) (let ((.cse3 (select (select |old(#memory_int#2)| |func_to_recursive_line_21_to_22_0_#in~a.base|) |func_to_recursive_line_21_to_22_0_#in~a.offset|))) (let ((.cse4 (= .cse3 0)) (.cse1 (= |#memory_int#1| |old(#memory_int#1)|)) (.cse2 (= |#memory_int#3| |old(#memory_int#3)|)) (.cse0 (select (select |#memory_int#2| |func_to_recursive_line_21_to_22_0_#in~a.base|) |func_to_recursive_line_21_to_22_0_#in~a.offset|))) (and (or (and (<= 1 .cse0) .cse1 .cse2) (< .cse3 1)) (let ((.cse5 (exists ((v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |old(#memory_int#1)| v_func_to_recursive_line_22_to_23_0_~b.base_BEFORE_CALL_2) v_func_to_recursive_line_22_to_23_0_~b.offset_BEFORE_CALL_2) 2147483648))))) (or (and .cse4 .cse5) (and .cse5 (<= 1 .cse3)))) (or (not .cse4) (and .cse1 .cse2 (= .cse0 0))))))) [2024-11-17 05:00:35,340 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 05:00:35,340 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-17 05:00:35,340 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-11-17 05:00:35,340 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~a!base,]]] [2024-11-17 05:00:35,340 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 05:00:35,340 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-17 05:00:35,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-17 05:00:35,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-11-17 05:00:35,341 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~a!base,]]] [2024-11-17 05:00:35,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 05:00:35 BoogieIcfgContainer [2024-11-17 05:00:35,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 05:00:35,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 05:00:35,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 05:00:35,342 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 05:00:35,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 04:59:29" (3/4) ... [2024-11-17 05:00:35,344 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 05:00:35,347 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_23_to_23_0 [2024-11-17 05:00:35,347 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_22_to_23_0 [2024-11-17 05:00:35,348 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_22_0 [2024-11-17 05:00:35,351 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-17 05:00:35,351 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-17 05:00:35,351 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-17 05:00:35,351 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 05:00:35,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 05:00:35,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 05:00:35,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 05:00:35,420 INFO L158 Benchmark]: Toolchain (without parser) took 67023.06ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 100.0MB in the beginning and 404.6MB in the end (delta: -304.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:00:35,420 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 05:00:35,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.58ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 87.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 05:00:35,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.32ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 86.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:00:35,421 INFO L158 Benchmark]: Boogie Preprocessor took 25.37ms. Allocated memory is still 167.8MB. Free memory was 86.1MB in the beginning and 84.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 05:00:35,421 INFO L158 Benchmark]: IcfgBuilder took 351.21ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 68.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-17 05:00:35,421 INFO L158 Benchmark]: TraceAbstraction took 66337.60ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 67.5MB in the beginning and 409.9MB in the end (delta: -342.4MB). Peak memory consumption was 211.7MB. Max. memory is 16.1GB. [2024-11-17 05:00:35,421 INFO L158 Benchmark]: Witness Printer took 78.05ms. Allocated memory is still 469.8MB. Free memory was 409.9MB in the beginning and 404.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 05:00:35,423 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.89ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.58ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 87.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.32ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 86.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.37ms. Allocated memory is still 167.8MB. Free memory was 86.1MB in the beginning and 84.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 351.21ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 68.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 66337.60ms. Allocated memory was 167.8MB in the beginning and 469.8MB in the end (delta: 302.0MB). Free memory was 67.5MB in the beginning and 409.9MB in the end (delta: -342.4MB). Peak memory consumption was 211.7MB. Max. memory is 16.1GB. * Witness Printer took 78.05ms. Allocated memory is still 469.8MB. Free memory was 409.9MB in the beginning and 404.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~a!base,]]] * 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 47 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 13, TraceHistogramMax: 42, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 305 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 1881 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1540 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2304 IncrementalHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 341 mSDtfsCounter, 2304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1617 GetRequests, 1368 SyntacticMatches, 5 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=12, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 21 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1783 NumberOfCodeBlocks, 1629 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2333 ConstructedInterpolants, 12 QuantifiedInterpolants, 6534 SizeOfPredicates, 36 NumberOfNonLiveVariables, 2159 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 16069/16685 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-17 05:00:35,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE