./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.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 c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:13:26,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:13:26,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:13:26,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:13:26,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:13:26,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:13:26,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:13:26,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:13:26,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:13:26,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:13:26,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:13:26,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:13:26,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:13:26,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:13:26,593 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:13:26,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:13:26,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:13:26,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:13:26,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:13:26,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:13:26,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:13:26,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:13:26,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:13:26,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:13:26,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:13:26,604 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:13:26,604 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:13:26,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:13:26,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:13:26,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:13:26,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:13:26,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:13:26,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:13:26,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:13:26,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:13:26,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:13:26,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:13:26,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:13:26,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:13:26,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:13:26,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:13:26,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:13:26,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:13:26,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:13:26,607 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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2024-10-14 21:13:26,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:13:26,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:13:26,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:13:26,826 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:13:26,826 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:13:26,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-10-14 21:13:28,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:13:28,336 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:13:28,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-10-14 21:13:28,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b347043/68e9d8fe62834a6f86f18ac532293eb4/FLAG6bc614dbd [2024-10-14 21:13:28,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4b347043/68e9d8fe62834a6f86f18ac532293eb4 [2024-10-14 21:13:28,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:13:28,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:13:28,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:13:28,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:13:28,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:13:28,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d3dceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28, skipping insertion in model container [2024-10-14 21:13:28,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:13:28,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:13:28,521 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:13:28,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:13:28,581 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:13:28,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28 WrapperNode [2024-10-14 21:13:28,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:13:28,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:13:28,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:13:28,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:13:28,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,617 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-10-14 21:13:28,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:13:28,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:13:28,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:13:28,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:13:28,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,663 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2024-10-14 21:13:28,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:13:28,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:13:28,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:13:28,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:13:28,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (1/1) ... [2024-10-14 21:13:28,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:13:28,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:28,717 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-10-14 21:13:28,725 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-10-14 21:13:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:13:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:13:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 21:13:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 21:13:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 21:13:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 21:13:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 21:13:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 21:13:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 21:13:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 21:13:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 21:13:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 21:13:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 21:13:28,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 21:13:28,760 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-10-14 21:13:28,760 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-10-14 21:13:28,760 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-10-14 21:13:28,760 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-10-14 21:13:28,760 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-10-14 21:13:28,760 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-10-14 21:13:28,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:13:28,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:13:28,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 21:13:28,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 21:13:28,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 21:13:28,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 21:13:28,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 21:13:28,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 21:13:28,761 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-10-14 21:13:28,762 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-10-14 21:13:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-10-14 21:13:28,762 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-10-14 21:13:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 21:13:28,859 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:13:28,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:13:29,048 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 21:13:29,048 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:13:29,075 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:13:29,075 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 21:13:29,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:13:29 BoogieIcfgContainer [2024-10-14 21:13:29,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:13:29,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:13:29,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:13:29,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:13:29,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:13:28" (1/3) ... [2024-10-14 21:13:29,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707518c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:13:29, skipping insertion in model container [2024-10-14 21:13:29,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:28" (2/3) ... [2024-10-14 21:13:29,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707518c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:13:29, skipping insertion in model container [2024-10-14 21:13:29,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:13:29" (3/3) ... [2024-10-14 21:13:29,084 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2024-10-14 21:13:29,099 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:13:29,099 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-14 21:13:29,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:13:29,152 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;@53cbf47e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:13:29,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-14 21:13:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 40 states have (on average 1.5) internal successors, (60), 55 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 21:13:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 21:13:29,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:29,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:29,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:29,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2007023355, now seen corresponding path program 1 times [2024-10-14 21:13:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:29,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606756901] [2024-10-14 21:13:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:29,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:29,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:29,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606756901] [2024-10-14 21:13:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606756901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:29,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:29,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:13:29,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084561556] [2024-10-14 21:13:29,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:29,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:13:29,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:29,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:13:29,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:13:29,640 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.5) internal successors, (60), 55 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-10-14 21:13:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:29,936 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2024-10-14 21:13:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:13:29,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 11 [2024-10-14 21:13:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:29,961 INFO L225 Difference]: With dead ends: 89 [2024-10-14 21:13:29,961 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 21:13:29,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:13:29,966 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 33 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:29,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 243 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:13:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 21:13:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2024-10-14 21:13:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.411764705882353) internal successors, (48), 47 states have internal predecessors, (48), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 21:13:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-10-14 21:13:29,999 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 11 [2024-10-14 21:13:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:29,999 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-10-14 21:13:30,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-10-14 21:13:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-10-14 21:13:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 21:13:30,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:30,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:30,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:13:30,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:30,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1663685642, now seen corresponding path program 1 times [2024-10-14 21:13:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:30,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849439074] [2024-10-14 21:13:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:13:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:30,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:30,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849439074] [2024-10-14 21:13:30,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849439074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:30,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:30,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:13:30,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700725617] [2024-10-14 21:13:30,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:30,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:30,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:30,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:30,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:13:30,309 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 21:13:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:30,448 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2024-10-14 21:13:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:13:30,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-14 21:13:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:30,450 INFO L225 Difference]: With dead ends: 130 [2024-10-14 21:13:30,450 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 21:13:30,451 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-10-14 21:13:30,452 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:30,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 144 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 21:13:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2024-10-14 21:13:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.4) internal successors, (49), 48 states have internal predecessors, (49), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-14 21:13:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-10-14 21:13:30,459 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 14 [2024-10-14 21:13:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:30,459 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-10-14 21:13:30,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 21:13:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-10-14 21:13:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 21:13:30,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:30,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:30,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 21:13:30,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:30,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:30,461 INFO L85 PathProgramCache]: Analyzing trace with hash 498483849, now seen corresponding path program 1 times [2024-10-14 21:13:30,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:30,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561367675] [2024-10-14 21:13:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:30,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:30,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:30,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561367675] [2024-10-14 21:13:30,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561367675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:30,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:30,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 21:13:30,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402899041] [2024-10-14 21:13:30,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:30,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:30,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:30,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:30,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:13:30,625 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:30,683 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions. [2024-10-14 21:13:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:13:30,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-14 21:13:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:30,685 INFO L225 Difference]: With dead ends: 122 [2024-10-14 21:13:30,685 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 21:13:30,686 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-10-14 21:13:30,686 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:30,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 266 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:13:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 21:13:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-14 21:13:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 50 states have internal predecessors, (52), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-14 21:13:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-10-14 21:13:30,699 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 17 [2024-10-14 21:13:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:30,699 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-10-14 21:13:30,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-10-14 21:13:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 21:13:30,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:30,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:30,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 21:13:30,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:30,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:30,701 INFO L85 PathProgramCache]: Analyzing trace with hash 504798164, now seen corresponding path program 1 times [2024-10-14 21:13:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068283175] [2024-10-14 21:13:30,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:30,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 21:13:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:30,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:30,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068283175] [2024-10-14 21:13:30,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068283175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:30,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:30,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:13:30,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135458032] [2024-10-14 21:13:30,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:30,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:13:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:30,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:13:30,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:13:30,872 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 21:13:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:31,011 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2024-10-14 21:13:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:13:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-14 21:13:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:31,012 INFO L225 Difference]: With dead ends: 89 [2024-10-14 21:13:31,012 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 21:13:31,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-10-14 21:13:31,013 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:31,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 222 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 21:13:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2024-10-14 21:13:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 55 states have internal predecessors, (58), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-14 21:13:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-10-14 21:13:31,020 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 17 [2024-10-14 21:13:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:31,021 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-10-14 21:13:31,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 21:13:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-10-14 21:13:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 21:13:31,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:31,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:31,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 21:13:31,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:31,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1726869798, now seen corresponding path program 1 times [2024-10-14 21:13:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:31,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449418689] [2024-10-14 21:13:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:31,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:31,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449418689] [2024-10-14 21:13:31,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449418689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:31,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:31,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:13:31,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828803018] [2024-10-14 21:13:31,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:31,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:13:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:31,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:13:31,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:13:31,069 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:31,085 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2024-10-14 21:13:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:13:31,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-14 21:13:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:31,087 INFO L225 Difference]: With dead ends: 72 [2024-10-14 21:13:31,087 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 21:13:31,087 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-10-14 21:13:31,088 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 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-10-14 21:13:31,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:13:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 21:13:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-14 21:13:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 54 states have internal predecessors, (57), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-14 21:13:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-10-14 21:13:31,093 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 18 [2024-10-14 21:13:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:31,094 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-10-14 21:13:31,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-10-14 21:13:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 21:13:31,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:31,095 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:31,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 21:13:31,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:31,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:31,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1851625347, now seen corresponding path program 1 times [2024-10-14 21:13:31,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:31,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497573621] [2024-10-14 21:13:31,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:31,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:31,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:31,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497573621] [2024-10-14 21:13:31,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497573621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:31,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:31,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:13:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506662531] [2024-10-14 21:13:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:31,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:13:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:31,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:13:31,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:13:31,279 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:31,351 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2024-10-14 21:13:31,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:13:31,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-14 21:13:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:31,353 INFO L225 Difference]: With dead ends: 75 [2024-10-14 21:13:31,354 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 21:13:31,355 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-10-14 21:13:31,355 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:31,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 262 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:13:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 21:13:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-10-14 21:13:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-14 21:13:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-10-14 21:13:31,369 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2024-10-14 21:13:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:31,369 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-10-14 21:13:31,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2024-10-14 21:13:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 21:13:31,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:31,370 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:31,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 21:13:31,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:31,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:31,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1813325083, now seen corresponding path program 1 times [2024-10-14 21:13:31,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:31,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182133323] [2024-10-14 21:13:31,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:31,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:31,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 21:13:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 21:13:31,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:31,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182133323] [2024-10-14 21:13:31,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182133323] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:31,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565127781] [2024-10-14 21:13:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:31,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:31,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:31,519 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-10-14 21:13:31,520 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-10-14 21:13:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:31,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 21:13:31,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:31,681 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-10-14 21:13:31,761 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-10-14 21:13:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:31,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:13:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565127781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:31,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:13:31,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-10-14 21:13:31,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892350369] [2024-10-14 21:13:31,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:31,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:13:31,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:31,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:13:31,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:13:31,775 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:13:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:31,883 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2024-10-14 21:13:31,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:13:31,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-10-14 21:13:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:31,884 INFO L225 Difference]: With dead ends: 70 [2024-10-14 21:13:31,884 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 21:13:31,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-14 21:13:31,885 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 61 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:31,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 234 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 21:13:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-14 21:13:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.255813953488372) internal successors, (54), 51 states have internal predecessors, (54), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-14 21:13:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-10-14 21:13:31,893 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 22 [2024-10-14 21:13:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:31,893 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-10-14 21:13:31,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:13:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-10-14 21:13:31,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 21:13:31,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:31,894 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 21:13:31,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 21:13:32,095 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-10-14 21:13:32,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:32,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:32,096 INFO L85 PathProgramCache]: Analyzing trace with hash 378502822, now seen corresponding path program 1 times [2024-10-14 21:13:32,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:32,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023319055] [2024-10-14 21:13:32,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:32,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 21:13:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:13:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:32,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023319055] [2024-10-14 21:13:32,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023319055] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:32,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128425340] [2024-10-14 21:13:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:32,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:32,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:32,246 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-10-14 21:13:32,247 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-10-14 21:13:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:13:32,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:32,385 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 15 treesize of output 7 [2024-10-14 21:13:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 21:13:32,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:13:32,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128425340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:32,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:13:32,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-14 21:13:32,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201615313] [2024-10-14 21:13:32,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:32,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:32,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:32,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:32,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:13:32,399 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:13:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:32,519 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2024-10-14 21:13:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:13:32,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-14 21:13:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:32,520 INFO L225 Difference]: With dead ends: 68 [2024-10-14 21:13:32,520 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 21:13:32,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:13:32,521 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 48 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:32,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 169 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 21:13:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2024-10-14 21:13:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.263157894736842) internal successors, (48), 46 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-10-14 21:13:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-10-14 21:13:32,529 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 23 [2024-10-14 21:13:32,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:32,530 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-10-14 21:13:32,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:13:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-10-14 21:13:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 21:13:32,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:32,531 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:32,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 21:13:32,731 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,SelfDestructingSolverStorable7 [2024-10-14 21:13:32,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:32,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:32,733 INFO L85 PathProgramCache]: Analyzing trace with hash -551866449, now seen corresponding path program 1 times [2024-10-14 21:13:32,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:32,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304618923] [2024-10-14 21:13:32,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:32,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 21:13:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 21:13:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:13:32,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:32,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304618923] [2024-10-14 21:13:32,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304618923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:32,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:32,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 21:13:32,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26034798] [2024-10-14 21:13:32,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:32,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:13:32,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:32,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:13:32,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:13:32,872 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:13:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:32,992 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2024-10-14 21:13:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:13:32,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2024-10-14 21:13:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:32,993 INFO L225 Difference]: With dead ends: 128 [2024-10-14 21:13:32,993 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 21:13:32,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:13:32,994 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 21 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:32,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 184 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 21:13:33,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-10-14 21:13:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 47 states have internal predecessors, (49), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 21:13:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2024-10-14 21:13:33,007 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 38 [2024-10-14 21:13:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:33,007 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2024-10-14 21:13:33,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:13:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2024-10-14 21:13:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 21:13:33,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:33,008 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:33,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 21:13:33,009 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:33,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1633138441, now seen corresponding path program 1 times [2024-10-14 21:13:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:33,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108345167] [2024-10-14 21:13:33,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:33,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 21:13:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 21:13:33,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:33,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108345167] [2024-10-14 21:13:33,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108345167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:33,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:33,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 21:13:33,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717777448] [2024-10-14 21:13:33,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:33,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:13:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:13:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:13:33,109 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:13:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:33,347 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2024-10-14 21:13:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:13:33,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-10-14 21:13:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:33,349 INFO L225 Difference]: With dead ends: 79 [2024-10-14 21:13:33,349 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 21:13:33,349 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-10-14 21:13:33,349 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 35 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:33,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 242 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:13:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 21:13:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2024-10-14 21:13:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 51 states have internal predecessors, (54), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-14 21:13:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-10-14 21:13:33,357 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 27 [2024-10-14 21:13:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:33,357 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-10-14 21:13:33,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:13:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2024-10-14 21:13:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 21:13:33,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:33,359 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:33,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 21:13:33,359 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:33,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash -704784010, now seen corresponding path program 1 times [2024-10-14 21:13:33,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:33,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028444194] [2024-10-14 21:13:33,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:33,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 21:13:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 21:13:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 21:13:33,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:33,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028444194] [2024-10-14 21:13:33,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028444194] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:33,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342759496] [2024-10-14 21:13:33,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:33,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:33,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:33,708 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-10-14 21:13:33,715 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-10-14 21:13:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:33,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 21:13:33,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:33,855 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-10-14 21:13:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 21:13:34,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 21:13:34,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342759496] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:34,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:34,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2024-10-14 21:13:34,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964470728] [2024-10-14 21:13:34,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:34,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 21:13:34,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:34,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 21:13:34,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2024-10-14 21:13:34,432 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 25 states, 19 states have (on average 2.789473684210526) internal successors, (53), 22 states have internal predecessors, (53), 8 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-14 21:13:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:34,688 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2024-10-14 21:13:34,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 21:13:34,689 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.789473684210526) internal successors, (53), 22 states have internal predecessors, (53), 8 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) Word has length 45 [2024-10-14 21:13:34,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:34,689 INFO L225 Difference]: With dead ends: 146 [2024-10-14 21:13:34,689 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 21:13:34,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2024-10-14 21:13:34,691 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 55 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:34,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 436 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:13:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 21:13:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-10-14 21:13:34,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 53 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (15), 12 states have call predecessors, (15), 10 states have call successors, (15) [2024-10-14 21:13:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2024-10-14 21:13:34,703 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 45 [2024-10-14 21:13:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:34,703 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-10-14 21:13:34,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.789473684210526) internal successors, (53), 22 states have internal predecessors, (53), 8 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-14 21:13:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2024-10-14 21:13:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 21:13:34,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:34,707 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:34,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 21:13:34,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:34,912 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:34,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:34,913 INFO L85 PathProgramCache]: Analyzing trace with hash 62702726, now seen corresponding path program 2 times [2024-10-14 21:13:34,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:34,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33001176] [2024-10-14 21:13:34,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:34,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:35,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 21:13:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:35,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:35,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:35,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 21:13:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:35,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:35,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:35,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-14 21:13:35,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33001176] [2024-10-14 21:13:35,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33001176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:35,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324752265] [2024-10-14 21:13:35,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:13:35,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:35,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:35,351 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-10-14 21:13:35,355 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-10-14 21:13:35,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:13:35,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:13:35,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 21:13:35,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:35,492 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-10-14 21:13:35,595 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-10-14 21:13:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 21:13:35,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:13:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324752265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:35,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:13:35,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2024-10-14 21:13:35,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452924723] [2024-10-14 21:13:35,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:35,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:13:35,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:35,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:13:35,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-14 21:13:35,610 INFO L87 Difference]: Start difference. First operand 73 states and 83 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:13:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:35,718 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2024-10-14 21:13:35,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:13:35,718 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 73 [2024-10-14 21:13:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:35,719 INFO L225 Difference]: With dead ends: 76 [2024-10-14 21:13:35,719 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 21:13:35,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-10-14 21:13:35,720 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:35,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 214 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 21:13:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-10-14 21:13:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (15), 12 states have call predecessors, (15), 10 states have call successors, (15) [2024-10-14 21:13:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2024-10-14 21:13:35,727 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 73 [2024-10-14 21:13:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:35,728 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2024-10-14 21:13:35,728 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:13:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2024-10-14 21:13:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 21:13:35,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:35,729 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:35,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 21:13:35,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:35,930 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:35,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1943784588, now seen corresponding path program 1 times [2024-10-14 21:13:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573351917] [2024-10-14 21:13:35,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:35,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:36,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 21:13:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:36,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:36,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:36,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:36,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 21:13:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:36,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:36,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:36,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-14 21:13:36,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:36,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573351917] [2024-10-14 21:13:36,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573351917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:36,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387871875] [2024-10-14 21:13:36,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:36,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:36,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:36,195 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-10-14 21:13:36,197 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-10-14 21:13:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:36,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:13:36,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:36,467 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 15 treesize of output 7 [2024-10-14 21:13:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-14 21:13:36,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:13:36,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387871875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:36,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:13:36,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-10-14 21:13:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405670437] [2024-10-14 21:13:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:36,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:36,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:36,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:36,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-14 21:13:36,493 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:13:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:36,577 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2024-10-14 21:13:36,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:13:36,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 74 [2024-10-14 21:13:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:36,578 INFO L225 Difference]: With dead ends: 72 [2024-10-14 21:13:36,579 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 21:13:36,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-14 21:13:36,580 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:36,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 178 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 21:13:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-10-14 21:13:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.186046511627907) internal successors, (51), 48 states have internal predecessors, (51), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (14), 11 states have call predecessors, (14), 9 states have call successors, (14) [2024-10-14 21:13:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2024-10-14 21:13:36,589 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 74 [2024-10-14 21:13:36,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:36,589 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2024-10-14 21:13:36,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 21:13:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2024-10-14 21:13:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 21:13:36,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:36,591 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:36,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 21:13:36,794 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,SelfDestructingSolverStorable12 [2024-10-14 21:13:36,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:36,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:36,795 INFO L85 PathProgramCache]: Analyzing trace with hash 268298317, now seen corresponding path program 1 times [2024-10-14 21:13:36,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:36,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243109622] [2024-10-14 21:13:36,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:36,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:36,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:13:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:37,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:37,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:37,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:37,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 21:13:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:37,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 21:13:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 21:13:37,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:37,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243109622] [2024-10-14 21:13:37,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243109622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:37,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158160414] [2024-10-14 21:13:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:37,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:37,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:37,584 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:13:37,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 21:13:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:37,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 21:13:37,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:37,696 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-10-14 21:13:37,878 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 21:13:37,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-14 21:13:38,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158160414] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:38,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:38,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 31 [2024-10-14 21:13:38,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864474153] [2024-10-14 21:13:38,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:38,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 21:13:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:38,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 21:13:38,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2024-10-14 21:13:38,334 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 31 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 10 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-14 21:13:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:38,745 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2024-10-14 21:13:38,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 21:13:38,746 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 10 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) Word has length 61 [2024-10-14 21:13:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:38,747 INFO L225 Difference]: With dead ends: 142 [2024-10-14 21:13:38,747 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 21:13:38,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=1547, Unknown=0, NotChecked=0, Total=1806 [2024-10-14 21:13:38,748 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 53 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:38,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 316 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:13:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 21:13:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2024-10-14 21:13:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 50 states have internal predecessors, (53), 11 states have call successors, (11), 8 states have call predecessors, (11), 11 states have return successors, (16), 13 states have call predecessors, (16), 9 states have call successors, (16) [2024-10-14 21:13:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2024-10-14 21:13:38,755 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 61 [2024-10-14 21:13:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:38,755 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2024-10-14 21:13:38,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 10 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-14 21:13:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2024-10-14 21:13:38,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 21:13:38,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:38,756 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:38,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 21:13:38,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:38,961 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:38,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash 90767087, now seen corresponding path program 2 times [2024-10-14 21:13:38,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:38,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858061614] [2024-10-14 21:13:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:13:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 21:13:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 21:13:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 21:13:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-10-14 21:13:39,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:39,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858061614] [2024-10-14 21:13:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858061614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:39,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:39,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 21:13:39,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652032909] [2024-10-14 21:13:39,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:39,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 21:13:39,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:39,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 21:13:39,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 21:13:39,250 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 21:13:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:39,399 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2024-10-14 21:13:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 21:13:39,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 109 [2024-10-14 21:13:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:39,401 INFO L225 Difference]: With dead ends: 87 [2024-10-14 21:13:39,401 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 21:13:39,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-14 21:13:39,402 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 61 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:39,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 190 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 21:13:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-10-14 21:13:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 57 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 13 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2024-10-14 21:13:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2024-10-14 21:13:39,414 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 109 [2024-10-14 21:13:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:39,415 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2024-10-14 21:13:39,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 21:13:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2024-10-14 21:13:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-14 21:13:39,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:39,417 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:39,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 21:13:39,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:39,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:39,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1186779084, now seen corresponding path program 1 times [2024-10-14 21:13:39,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:39,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534710230] [2024-10-14 21:13:39,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:39,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:40,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 21:13:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:40,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:40,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 21:13:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 21:13:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 21:13:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 21:13:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 21:13:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 19 proven. 414 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2024-10-14 21:13:41,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:41,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534710230] [2024-10-14 21:13:41,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534710230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:41,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018568563] [2024-10-14 21:13:41,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:41,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:41,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:41,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:13:41,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 21:13:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:41,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-14 21:13:41,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:41,464 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-10-14 21:13:41,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 21:13:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 460 proven. 24 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2024-10-14 21:13:41,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 7 proven. 523 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-10-14 21:13:44,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018568563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:44,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:44,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 26] total 46 [2024-10-14 21:13:44,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092244429] [2024-10-14 21:13:44,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:44,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-14 21:13:44,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:44,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-14 21:13:44,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1707, Unknown=0, NotChecked=0, Total=2070 [2024-10-14 21:13:44,033 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 46 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 39 states have internal predecessors, (88), 12 states have call successors, (30), 9 states have call predecessors, (30), 13 states have return successors, (25), 11 states have call predecessors, (25), 12 states have call successors, (25) [2024-10-14 21:13:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:44,508 INFO L93 Difference]: Finished difference Result 168 states and 201 transitions. [2024-10-14 21:13:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 21:13:44,508 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 39 states have internal predecessors, (88), 12 states have call successors, (30), 9 states have call predecessors, (30), 13 states have return successors, (25), 11 states have call predecessors, (25), 12 states have call successors, (25) Word has length 192 [2024-10-14 21:13:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:44,509 INFO L225 Difference]: With dead ends: 168 [2024-10-14 21:13:44,509 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 21:13:44,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 403 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=2409, Unknown=0, NotChecked=0, Total=2970 [2024-10-14 21:13:44,511 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 34 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:44,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 699 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:13:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 21:13:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-10-14 21:13:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 59 states have internal predecessors, (63), 12 states have call successors, (12), 9 states have call predecessors, (12), 15 states have return successors, (21), 16 states have call predecessors, (21), 10 states have call successors, (21) [2024-10-14 21:13:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-10-14 21:13:44,519 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 192 [2024-10-14 21:13:44,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:44,519 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-10-14 21:13:44,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 39 states have internal predecessors, (88), 12 states have call successors, (30), 9 states have call predecessors, (30), 13 states have return successors, (25), 11 states have call predecessors, (25), 12 states have call successors, (25) [2024-10-14 21:13:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-10-14 21:13:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-14 21:13:44,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:44,521 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:44,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 21:13:44,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:44,726 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:44,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:44,726 INFO L85 PathProgramCache]: Analyzing trace with hash -137497908, now seen corresponding path program 2 times [2024-10-14 21:13:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:44,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688739262] [2024-10-14 21:13:44,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:44,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 21:13:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 21:13:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 2371 trivial. 0 not checked. [2024-10-14 21:13:46,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:46,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688739262] [2024-10-14 21:13:46,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688739262] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:46,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989110603] [2024-10-14 21:13:46,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:13:46,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:46,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:46,068 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:13:46,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 21:13:46,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:13:46,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:13:46,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 21:13:46,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:46,325 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-10-14 21:13:46,568 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-10-14 21:13:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 1277 proven. 0 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2024-10-14 21:13:46,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:13:46,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989110603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:46,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:13:46,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2024-10-14 21:13:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072026142] [2024-10-14 21:13:46,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:46,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:13:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:46,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:13:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2024-10-14 21:13:46,587 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 21:13:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:46,692 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-10-14 21:13:46,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:13:46,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 248 [2024-10-14 21:13:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:46,694 INFO L225 Difference]: With dead ends: 88 [2024-10-14 21:13:46,694 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 21:13:46,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2024-10-14 21:13:46,695 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:46,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 156 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 21:13:46,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-10-14 21:13:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 15 states have return successors, (21), 16 states have call predecessors, (21), 10 states have call successors, (21) [2024-10-14 21:13:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2024-10-14 21:13:46,704 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 248 [2024-10-14 21:13:46,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:46,705 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-10-14 21:13:46,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 21:13:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2024-10-14 21:13:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-14 21:13:46,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:46,706 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:46,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 21:13:46,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 21:13:46,907 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:46,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash 32532202, now seen corresponding path program 1 times [2024-10-14 21:13:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:46,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54554309] [2024-10-14 21:13:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 21:13:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 21:13:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2436 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2430 trivial. 0 not checked. [2024-10-14 21:13:47,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:47,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54554309] [2024-10-14 21:13:47,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54554309] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:47,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036384007] [2024-10-14 21:13:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:47,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:47,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:47,521 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:13:47,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 21:13:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:47,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:13:47,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:47,974 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 15 treesize of output 7 [2024-10-14 21:13:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2436 backedges. 1277 proven. 0 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2024-10-14 21:13:47,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:13:47,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036384007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:47,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:13:47,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-14 21:13:47,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662050265] [2024-10-14 21:13:47,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:47,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:47,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:47,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:47,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-14 21:13:47,989 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 21:13:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:48,050 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2024-10-14 21:13:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:13:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 249 [2024-10-14 21:13:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:48,051 INFO L225 Difference]: With dead ends: 84 [2024-10-14 21:13:48,052 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 21:13:48,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-14 21:13:48,053 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:48,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:13:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 21:13:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-10-14 21:13:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 54 states have internal predecessors, (58), 11 states have call successors, (11), 9 states have call predecessors, (11), 15 states have return successors, (20), 15 states have call predecessors, (20), 9 states have call successors, (20) [2024-10-14 21:13:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2024-10-14 21:13:48,064 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 249 [2024-10-14 21:13:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:48,065 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2024-10-14 21:13:48,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 21:13:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2024-10-14 21:13:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-14 21:13:48,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:48,067 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:48,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 21:13:48,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 21:13:48,268 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:48,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1532190731, now seen corresponding path program 1 times [2024-10-14 21:13:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117012612] [2024-10-14 21:13:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:48,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:13:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:48,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:48,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 21:13:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 21:13:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 21:13:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2459 trivial. 0 not checked. [2024-10-14 21:13:49,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:49,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117012612] [2024-10-14 21:13:49,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117012612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:49,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043197729] [2024-10-14 21:13:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:49,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:49,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:49,142 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:13:49,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 21:13:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:49,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-14 21:13:49,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:49,439 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-10-14 21:13:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1282 proven. 8 refuted. 0 times theorem prover too weak. 1174 trivial. 0 not checked. [2024-10-14 21:13:49,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 5 proven. 82 refuted. 0 times theorem prover too weak. 2377 trivial. 0 not checked. [2024-10-14 21:13:51,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043197729] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:51,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:51,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 16] total 35 [2024-10-14 21:13:51,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109744941] [2024-10-14 21:13:51,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:51,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 21:13:51,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:51,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 21:13:51,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 21:13:51,038 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 35 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 26 states have internal predecessors, (91), 13 states have call successors, (34), 11 states have call predecessors, (34), 8 states have return successors, (25), 11 states have call predecessors, (25), 12 states have call successors, (25) [2024-10-14 21:13:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:51,642 INFO L93 Difference]: Finished difference Result 164 states and 196 transitions. [2024-10-14 21:13:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 21:13:51,642 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 26 states have internal predecessors, (91), 13 states have call successors, (34), 11 states have call predecessors, (34), 8 states have return successors, (25), 11 states have call predecessors, (25), 12 states have call successors, (25) Word has length 271 [2024-10-14 21:13:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:51,643 INFO L225 Difference]: With dead ends: 164 [2024-10-14 21:13:51,643 INFO L226 Difference]: Without dead ends: 87 [2024-10-14 21:13:51,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=335, Invalid=2115, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 21:13:51,644 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 128 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:51,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 329 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:13:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-14 21:13:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-10-14 21:13:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 11 states have call successors, (11), 9 states have call predecessors, (11), 16 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) [2024-10-14 21:13:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2024-10-14 21:13:51,653 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 271 [2024-10-14 21:13:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:51,654 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2024-10-14 21:13:51,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 26 states have internal predecessors, (91), 13 states have call successors, (34), 11 states have call predecessors, (34), 8 states have return successors, (25), 11 states have call predecessors, (25), 12 states have call successors, (25) [2024-10-14 21:13:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2024-10-14 21:13:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-14 21:13:51,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:51,657 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 36, 36, 8, 8, 6, 6, 6, 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-10-14 21:13:51,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 21:13:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:51,858 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-10-14 21:13:51,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash -140565068, now seen corresponding path program 1 times [2024-10-14 21:13:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853290292] [2024-10-14 21:13:51,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 21:13:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:52,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 21:13:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 21:13:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:53,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 21:13:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 21:13:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 21:13:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 21:13:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 17 proven. 117 refuted. 0 times theorem prover too weak. 5422 trivial. 0 not checked. [2024-10-14 21:13:54,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853290292] [2024-10-14 21:13:54,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853290292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350443235] [2024-10-14 21:13:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:54,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:54,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:54,091 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:13:54,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 21:13:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:54,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:13:54,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:54,848 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 15 treesize of output 7 [2024-10-14 21:13:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 2871 proven. 0 refuted. 0 times theorem prover too weak. 2685 trivial. 0 not checked. [2024-10-14 21:13:54,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:13:54,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350443235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:54,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:13:54,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 24 [2024-10-14 21:13:54,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395457118] [2024-10-14 21:13:54,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:54,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:54,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:54,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:54,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2024-10-14 21:13:54,870 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 21:13:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:54,961 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2024-10-14 21:13:54,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:13:54,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 382 [2024-10-14 21:13:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:54,962 INFO L225 Difference]: With dead ends: 86 [2024-10-14 21:13:54,962 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 21:13:54,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 484 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2024-10-14 21:13:54,963 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:54,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 21:13:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 21:13:54,963 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-10-14 21:13:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 21:13:54,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 382 [2024-10-14 21:13:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:54,964 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 21:13:54,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 21:13:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 21:13:54,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 21:13:54,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-14 21:13:54,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-14 21:13:54,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-14 21:13:54,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-14 21:13:54,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-14 21:13:54,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-14 21:13:54,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-14 21:13:54,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-14 21:13:54,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-14 21:13:54,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-14 21:13:54,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 21:13:55,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:55,174 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:55,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 21:14:55,915 WARN L286 SmtUtils]: Spent 1.00m on a formula simplification. DAG size of input: 100 DAG size of output: 77 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)