./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.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 ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:40:39,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:40:39,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:40:39,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:40:39,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:40:39,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:40:39,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:40:39,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:40:39,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:40:39,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:40:39,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:40:39,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:40:39,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:40:39,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:40:39,331 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:40:39,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:40:39,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:40:39,331 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:40:39,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:40:39,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:40:39,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:40:39,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:40:39,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:40:39,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:40:39,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:40:39,335 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:40:39,335 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:40:39,335 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:40:39,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:40:39,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:40:39,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:40:39,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:40:39,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:40:39,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:40:39,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:40:39,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:40:39,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:40:39,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:40:39,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:40:39,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:40:39,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:40:39,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:40:39,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:40:39,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:40:39,341 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 -> ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e [2024-11-10 19:40:39,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:40:39,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:40:39,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:40:39,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:40:39,569 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:40:39,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2024-11-10 19:40:41,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:40:41,673 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:40:41,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2024-11-10 19:40:41,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639e3285e/c6b6fc033bbb4049adc9a596793960a9/FLAGa698be6e5 [2024-11-10 19:40:41,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639e3285e/c6b6fc033bbb4049adc9a596793960a9 [2024-11-10 19:40:41,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:40:41,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:40:41,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:40:41,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:40:41,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:40:41,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:41,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14664531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41, skipping insertion in model container [2024-11-10 19:40:41,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:41,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:40:41,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:40:41,871 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:40:41,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:40:41,918 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:40:41,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41 WrapperNode [2024-11-10 19:40:41,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:40:41,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:40:41,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:40:41,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:40:41,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:41,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:41,966 INFO L138 Inliner]: procedures = 16, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 197 [2024-11-10 19:40:41,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:40:41,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:40:41,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:40:41,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:40:41,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:41,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:41,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:41,999 INFO L175 MemorySlicer]: Split 66 memory accesses to 6 slices as follows [2, 11, 5, 12, 15, 21]. 32 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 2, 1, 2, 2, 2]. [2024-11-10 19:40:42,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:42,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:42,010 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:42,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:42,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:42,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:42,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:40:42,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:40:42,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:40:42,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:40:42,019 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (1/1) ... [2024-11-10 19:40:42,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:40:42,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:40:42,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 19:40:42,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 19:40:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:40:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:40:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 19:40:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 19:40:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 19:40:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 19:40:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 19:40:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 19:40:42,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 19:40:42,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 19:40:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 19:40:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 19:40:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 19:40:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 19:40:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_39_0 [2024-11-10 19:40:42,103 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_39_0 [2024-11-10 19:40:42,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:40:42,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:40:42,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 19:40:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 19:40:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 19:40:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 19:40:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 19:40:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 19:40:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:40:42,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:40:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 19:40:42,222 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:40:42,224 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:40:43,106 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#n~0#1.base, main_~#n~0#1.offset);havoc main_~#n~0#1.base, main_~#n~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#z~0#1.base, main_~#z~0#1.offset);havoc main_~#z~0#1.base, main_~#z~0#1.offset; [2024-11-10 19:40:43,132 INFO L? ?]: Removed 357 outVars from TransFormulas that were not future-live. [2024-11-10 19:40:43,132 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:40:43,146 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:40:43,147 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:40:43,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:40:43 BoogieIcfgContainer [2024-11-10 19:40:43,147 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:40:43,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:40:43,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:40:43,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:40:43,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:40:41" (1/3) ... [2024-11-10 19:40:43,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c1577a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:40:43, skipping insertion in model container [2024-11-10 19:40:43,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:41" (2/3) ... [2024-11-10 19:40:43,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c1577a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:40:43, skipping insertion in model container [2024-11-10 19:40:43,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:40:43" (3/3) ... [2024-11-10 19:40:43,153 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_cohencu.c [2024-11-10 19:40:43,164 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:40:43,164 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2024-11-10 19:40:43,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:40:43,209 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;@8a3c125, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:40:43,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2024-11-10 19:40:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 346 states, 192 states have (on average 1.734375) internal successors, (333), 331 states have internal predecessors, (333), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 19:40:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 19:40:43,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:43,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 19:40:43,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_27_to_39_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:43,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1880030094, now seen corresponding path program 1 times [2024-11-10 19:40:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:43,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043448320] [2024-11-10 19:40:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:40:43,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:43,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043448320] [2024-11-10 19:40:43,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043448320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:43,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:43,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:40:43,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903650579] [2024-11-10 19:40:43,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:43,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:40:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:43,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:40:43,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:40:43,644 INFO L87 Difference]: Start difference. First operand has 346 states, 192 states have (on average 1.734375) internal successors, (333), 331 states have internal predecessors, (333), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:40:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:43,801 INFO L93 Difference]: Finished difference Result 805 states and 859 transitions. [2024-11-10 19:40:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:40:43,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 19:40:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:43,810 INFO L225 Difference]: With dead ends: 805 [2024-11-10 19:40:43,810 INFO L226 Difference]: Without dead ends: 456 [2024-11-10 19:40:43,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:40:43,816 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 223 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:43,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1675 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:40:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-10 19:40:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 408. [2024-11-10 19:40:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 250 states have (on average 1.724) internal successors, (431), 388 states have internal predecessors, (431), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-10 19:40:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 466 transitions. [2024-11-10 19:40:43,870 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 466 transitions. Word has length 6 [2024-11-10 19:40:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:43,870 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 466 transitions. [2024-11-10 19:40:43,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:40:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 466 transitions. [2024-11-10 19:40:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 19:40:43,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:43,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:43,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:40:43,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_27_to_39_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:43,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1821157346, now seen corresponding path program 1 times [2024-11-10 19:40:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286239579] [2024-11-10 19:40:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:43,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:40:43,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:43,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286239579] [2024-11-10 19:40:43,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286239579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:43,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:43,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:40:43,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46909934] [2024-11-10 19:40:43,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:43,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:40:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:44,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:40:44,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:40:44,000 INFO L87 Difference]: Start difference. First operand 408 states and 466 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:40:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:44,124 INFO L93 Difference]: Finished difference Result 456 states and 472 transitions. [2024-11-10 19:40:44,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:40:44,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2024-11-10 19:40:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:44,127 INFO L225 Difference]: With dead ends: 456 [2024-11-10 19:40:44,127 INFO L226 Difference]: Without dead ends: 452 [2024-11-10 19:40:44,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:40:44,128 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 220 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:44,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1620 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:40:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-10 19:40:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2024-11-10 19:40:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 250 states have (on average 1.708) internal successors, (427), 388 states have internal predecessors, (427), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-10 19:40:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 462 transitions. [2024-11-10 19:40:44,146 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 462 transitions. Word has length 16 [2024-11-10 19:40:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:44,146 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 462 transitions. [2024-11-10 19:40:44,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:40:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 462 transitions. [2024-11-10 19:40:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 19:40:44,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:44,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:44,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:40:44,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_39_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:44,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1473923165, now seen corresponding path program 1 times [2024-11-10 19:40:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:44,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109309620] [2024-11-10 19:40:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:44,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:44,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:40:44,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:44,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109309620] [2024-11-10 19:40:44,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109309620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:44,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:44,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:40:44,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287614261] [2024-11-10 19:40:44,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:44,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:40:44,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:44,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:40:44,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:40:44,282 INFO L87 Difference]: Start difference. First operand 408 states and 462 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:40:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:44,406 INFO L93 Difference]: Finished difference Result 452 states and 468 transitions. [2024-11-10 19:40:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:40:44,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 22 [2024-11-10 19:40:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:44,409 INFO L225 Difference]: With dead ends: 452 [2024-11-10 19:40:44,409 INFO L226 Difference]: Without dead ends: 450 [2024-11-10 19:40:44,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:40:44,410 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 202 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:44,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1626 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:40:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-10 19:40:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 408. [2024-11-10 19:40:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 250 states have (on average 1.7) internal successors, (425), 388 states have internal predecessors, (425), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-10 19:40:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 460 transitions. [2024-11-10 19:40:44,421 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 460 transitions. Word has length 22 [2024-11-10 19:40:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:44,421 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 460 transitions. [2024-11-10 19:40:44,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:40:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 460 transitions. [2024-11-10 19:40:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 19:40:44,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:44,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:44,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:40:44,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_27_to_39_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:44,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:44,422 INFO L85 PathProgramCache]: Analyzing trace with hash -899043525, now seen corresponding path program 1 times [2024-11-10 19:40:44,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:44,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429810687] [2024-11-10 19:40:44,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:40:44,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:44,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429810687] [2024-11-10 19:40:44,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429810687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:44,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:44,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:40:44,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840076773] [2024-11-10 19:40:44,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:44,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:40:44,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:44,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:40:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:40:44,531 INFO L87 Difference]: Start difference. First operand 408 states and 460 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:40:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:44,676 INFO L93 Difference]: Finished difference Result 450 states and 466 transitions. [2024-11-10 19:40:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:40:44,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 24 [2024-11-10 19:40:44,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:44,678 INFO L225 Difference]: With dead ends: 450 [2024-11-10 19:40:44,679 INFO L226 Difference]: Without dead ends: 448 [2024-11-10 19:40:44,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:40:44,680 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 205 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:44,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1695 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:40:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-10 19:40:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 408. [2024-11-10 19:40:44,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 250 states have (on average 1.692) internal successors, (423), 388 states have internal predecessors, (423), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-10 19:40:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 458 transitions. [2024-11-10 19:40:44,688 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 458 transitions. Word has length 24 [2024-11-10 19:40:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:44,689 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 458 transitions. [2024-11-10 19:40:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:40:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 458 transitions. [2024-11-10 19:40:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 19:40:44,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:44,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:44,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 19:40:44,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_39_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:44,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2100545422, now seen corresponding path program 1 times [2024-11-10 19:40:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:44,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867848933] [2024-11-10 19:40:44,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:44,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:44,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:40:44,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:44,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867848933] [2024-11-10 19:40:44,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867848933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:44,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:40:44,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348754109] [2024-11-10 19:40:44,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:44,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:40:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:44,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:40:44,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:40:44,815 INFO L87 Difference]: Start difference. First operand 408 states and 458 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:40:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:44,953 INFO L93 Difference]: Finished difference Result 448 states and 464 transitions. [2024-11-10 19:40:44,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:40:44,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 25 [2024-11-10 19:40:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:44,955 INFO L225 Difference]: With dead ends: 448 [2024-11-10 19:40:44,956 INFO L226 Difference]: Without dead ends: 446 [2024-11-10 19:40:44,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:40:44,957 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 201 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:44,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1699 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:40:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-10 19:40:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 408. [2024-11-10 19:40:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 250 states have (on average 1.684) internal successors, (421), 388 states have internal predecessors, (421), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-11-10 19:40:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 456 transitions. [2024-11-10 19:40:44,966 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 456 transitions. Word has length 25 [2024-11-10 19:40:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:44,966 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 456 transitions. [2024-11-10 19:40:44,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 19:40:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 456 transitions. [2024-11-10 19:40:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 19:40:44,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:44,967 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 19:40:44,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 19:40:44,968 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_39_0Err39ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:44,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1022135681, now seen corresponding path program 1 times [2024-11-10 19:40:44,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:44,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248182405] [2024-11-10 19:40:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:44,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:40:44,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1253448] [2024-11-10 19:40:44,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:44,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:44,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:40:44,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:40:44,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 19:40:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:45,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 19:40:45,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:40:45,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:40:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:40:45,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:40:45,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:45,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248182405] [2024-11-10 19:40:45,266 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:40:45,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253448] [2024-11-10 19:40:45,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:45,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:45,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:40:45,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591341993] [2024-11-10 19:40:45,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:45,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:40:45,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:45,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:40:45,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:40:45,267 INFO L87 Difference]: Start difference. First operand 408 states and 456 transitions. Second operand has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:40:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:45,472 INFO L93 Difference]: Finished difference Result 645 states and 664 transitions. [2024-11-10 19:40:45,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:40:45,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-10 19:40:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:45,475 INFO L225 Difference]: With dead ends: 645 [2024-11-10 19:40:45,475 INFO L226 Difference]: Without dead ends: 641 [2024-11-10 19:40:45,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:40:45,476 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 458 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:45,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1649 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:40:45,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-10 19:40:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 504. [2024-11-10 19:40:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6911764705882353) internal successors, (575), 478 states have internal predecessors, (575), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 620 transitions. [2024-11-10 19:40:45,490 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 620 transitions. Word has length 34 [2024-11-10 19:40:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:45,490 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 620 transitions. [2024-11-10 19:40:45,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:40:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 620 transitions. [2024-11-10 19:40:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 19:40:45,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:45,492 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:45,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 19:40:45,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 19:40:45,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_39_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:45,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1243505487, now seen corresponding path program 1 times [2024-11-10 19:40:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125437873] [2024-11-10 19:40:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:40:45,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766274764] [2024-11-10 19:40:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:45,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:45,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:40:45,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:40:45,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 19:40:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:45,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 19:40:45,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:40:45,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:40:45,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:40:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:40:46,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:40:46,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:46,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125437873] [2024-11-10 19:40:46,158 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:40:46,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766274764] [2024-11-10 19:40:46,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766274764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:46,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:46,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:40:46,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475503851] [2024-11-10 19:40:46,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:46,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:40:46,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:46,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:40:46,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:40:46,160 INFO L87 Difference]: Start difference. First operand 504 states and 620 transitions. Second operand has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:46,400 INFO L93 Difference]: Finished difference Result 651 states and 670 transitions. [2024-11-10 19:40:46,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:40:46,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-10 19:40:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:46,402 INFO L225 Difference]: With dead ends: 651 [2024-11-10 19:40:46,403 INFO L226 Difference]: Without dead ends: 650 [2024-11-10 19:40:46,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:40:46,403 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 482 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:46,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1540 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:40:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-10 19:40:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 504. [2024-11-10 19:40:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.688235294117647) internal successors, (574), 478 states have internal predecessors, (574), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 619 transitions. [2024-11-10 19:40:46,414 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 619 transitions. Word has length 45 [2024-11-10 19:40:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:46,414 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 619 transitions. [2024-11-10 19:40:46,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 619 transitions. [2024-11-10 19:40:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 19:40:46,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:46,415 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:46,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 19:40:46,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 19:40:46,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_27_to_39_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:46,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash -106035511, now seen corresponding path program 1 times [2024-11-10 19:40:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:46,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574345711] [2024-11-10 19:40:46,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:46,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:40:46,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172476485] [2024-11-10 19:40:46,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:46,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:46,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:40:46,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:40:46,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 19:40:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:46,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 19:40:46,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:40:46,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:40:46,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:40:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:40:46,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:40:46,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:46,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574345711] [2024-11-10 19:40:46,965 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:40:46,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172476485] [2024-11-10 19:40:46,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172476485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:46,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:46,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:40:46,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136214636] [2024-11-10 19:40:46,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:46,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:40:46,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:46,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:40:46,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:40:46,967 INFO L87 Difference]: Start difference. First operand 504 states and 619 transitions. Second operand has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:47,217 INFO L93 Difference]: Finished difference Result 650 states and 669 transitions. [2024-11-10 19:40:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:40:47,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-10 19:40:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:47,220 INFO L225 Difference]: With dead ends: 650 [2024-11-10 19:40:47,220 INFO L226 Difference]: Without dead ends: 649 [2024-11-10 19:40:47,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:40:47,221 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 652 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:47,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1355 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:40:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-10 19:40:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 504. [2024-11-10 19:40:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6852941176470588) internal successors, (573), 478 states have internal predecessors, (573), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 618 transitions. [2024-11-10 19:40:47,231 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 618 transitions. Word has length 46 [2024-11-10 19:40:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:47,231 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 618 transitions. [2024-11-10 19:40:47,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 618 transitions. [2024-11-10 19:40:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 19:40:47,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:47,232 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:47,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 19:40:47,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:47,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_27_to_39_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:47,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1179090791, now seen corresponding path program 1 times [2024-11-10 19:40:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:47,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135180075] [2024-11-10 19:40:47,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:47,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:47,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:47,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:40:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:47,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:40:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:40:47,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:47,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135180075] [2024-11-10 19:40:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135180075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:47,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:47,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:40:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253001701] [2024-11-10 19:40:47,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:47,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:40:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:47,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:40:47,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:40:47,563 INFO L87 Difference]: Start difference. First operand 504 states and 618 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:47,709 INFO L93 Difference]: Finished difference Result 614 states and 634 transitions. [2024-11-10 19:40:47,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:40:47,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-10 19:40:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:47,711 INFO L225 Difference]: With dead ends: 614 [2024-11-10 19:40:47,711 INFO L226 Difference]: Without dead ends: 612 [2024-11-10 19:40:47,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:40:47,712 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 346 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:47,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1576 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:40:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-10 19:40:47,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 504. [2024-11-10 19:40:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6794117647058824) internal successors, (571), 478 states have internal predecessors, (571), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 616 transitions. [2024-11-10 19:40:47,722 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 616 transitions. Word has length 48 [2024-11-10 19:40:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:47,722 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 616 transitions. [2024-11-10 19:40:47,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 616 transitions. [2024-11-10 19:40:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 19:40:47,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:47,723 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:47,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 19:40:47,724 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_27_to_39_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:47,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash -765114363, now seen corresponding path program 1 times [2024-11-10 19:40:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:47,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071183539] [2024-11-10 19:40:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:47,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:40:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:40:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:40:47,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:47,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071183539] [2024-11-10 19:40:47,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071183539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:47,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:47,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:40:47,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073337612] [2024-11-10 19:40:47,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:47,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:40:47,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:47,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:40:47,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:40:47,861 INFO L87 Difference]: Start difference. First operand 504 states and 616 transitions. Second operand has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:48,149 INFO L93 Difference]: Finished difference Result 612 states and 632 transitions. [2024-11-10 19:40:48,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:40:48,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-10 19:40:48,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:48,151 INFO L225 Difference]: With dead ends: 612 [2024-11-10 19:40:48,151 INFO L226 Difference]: Without dead ends: 611 [2024-11-10 19:40:48,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:40:48,152 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 342 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:48,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1865 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:40:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-10 19:40:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 504. [2024-11-10 19:40:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6764705882352942) internal successors, (570), 478 states have internal predecessors, (570), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 615 transitions. [2024-11-10 19:40:48,161 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 615 transitions. Word has length 50 [2024-11-10 19:40:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:48,162 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 615 transitions. [2024-11-10 19:40:48,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 615 transitions. [2024-11-10 19:40:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 19:40:48,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:48,163 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:48,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 19:40:48,163 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:48,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:48,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2051258570, now seen corresponding path program 1 times [2024-11-10 19:40:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:48,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482103537] [2024-11-10 19:40:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:48,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:48,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:48,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:40:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:48,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:40:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:40:48,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:48,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482103537] [2024-11-10 19:40:48,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482103537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:48,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:48,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:40:48,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329550251] [2024-11-10 19:40:48,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:48,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:40:48,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:48,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:40:48,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:40:48,344 INFO L87 Difference]: Start difference. First operand 504 states and 615 transitions. Second operand has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:48,832 INFO L93 Difference]: Finished difference Result 611 states and 631 transitions. [2024-11-10 19:40:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:40:48,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-11-10 19:40:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:48,834 INFO L225 Difference]: With dead ends: 611 [2024-11-10 19:40:48,834 INFO L226 Difference]: Without dead ends: 610 [2024-11-10 19:40:48,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:40:48,834 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 360 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:48,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1636 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:40:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-10 19:40:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 504. [2024-11-10 19:40:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.673529411764706) internal successors, (569), 478 states have internal predecessors, (569), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 614 transitions. [2024-11-10 19:40:48,844 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 614 transitions. Word has length 51 [2024-11-10 19:40:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:48,845 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 614 transitions. [2024-11-10 19:40:48,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 614 transitions. [2024-11-10 19:40:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 19:40:48,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:48,846 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:48,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 19:40:48,846 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_27_to_39_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:48,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:48,846 INFO L85 PathProgramCache]: Analyzing trace with hash -130501624, now seen corresponding path program 1 times [2024-11-10 19:40:48,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:48,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419408831] [2024-11-10 19:40:48,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:48,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:40:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:40:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:40:48,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:48,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419408831] [2024-11-10 19:40:48,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419408831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:48,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:48,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:40:48,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017792042] [2024-11-10 19:40:48,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:48,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:40:48,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:48,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:40:48,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:40:48,974 INFO L87 Difference]: Start difference. First operand 504 states and 614 transitions. Second operand has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:49,125 INFO L93 Difference]: Finished difference Result 624 states and 644 transitions. [2024-11-10 19:40:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:40:49,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-10 19:40:49,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:49,128 INFO L225 Difference]: With dead ends: 624 [2024-11-10 19:40:49,128 INFO L226 Difference]: Without dead ends: 622 [2024-11-10 19:40:49,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:40:49,128 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 345 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:49,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1568 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:40:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-10 19:40:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 504. [2024-11-10 19:40:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6676470588235295) internal successors, (567), 478 states have internal predecessors, (567), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 612 transitions. [2024-11-10 19:40:49,138 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 612 transitions. Word has length 53 [2024-11-10 19:40:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:49,138 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 612 transitions. [2024-11-10 19:40:49,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 612 transitions. [2024-11-10 19:40:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 19:40:49,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:49,139 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:49,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 19:40:49,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_27_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:49,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash -858007738, now seen corresponding path program 1 times [2024-11-10 19:40:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:49,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550506901] [2024-11-10 19:40:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:40:49,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933588825] [2024-11-10 19:40:49,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:49,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:49,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:40:49,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:40:49,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 19:40:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:49,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-10 19:40:49,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:40:49,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:40:49,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:40:49,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:40:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:40:50,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:40:54,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:54,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550506901] [2024-11-10 19:40:54,395 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:40:54,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933588825] [2024-11-10 19:40:54,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933588825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:40:54,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:40:54,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-10 19:40:54,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233662304] [2024-11-10 19:40:54,396 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:40:54,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 19:40:54,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:54,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 19:40:54,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=393, Unknown=1, NotChecked=0, Total=462 [2024-11-10 19:40:54,397 INFO L87 Difference]: Start difference. First operand 504 states and 612 transitions. Second operand has 17 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:40:55,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:55,651 INFO L93 Difference]: Finished difference Result 638 states and 657 transitions. [2024-11-10 19:40:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 19:40:55,652 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2024-11-10 19:40:55,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:55,654 INFO L225 Difference]: With dead ends: 638 [2024-11-10 19:40:55,654 INFO L226 Difference]: Without dead ends: 637 [2024-11-10 19:40:55,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=183, Invalid=808, Unknown=1, NotChecked=0, Total=992 [2024-11-10 19:40:55,655 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 806 mSDsluCounter, 2963 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 3238 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:55,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 3238 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 19:40:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-10 19:40:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 504. [2024-11-10 19:40:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6647058823529413) internal successors, (566), 478 states have internal predecessors, (566), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 611 transitions. [2024-11-10 19:40:55,665 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 611 transitions. Word has length 55 [2024-11-10 19:40:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:55,665 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 611 transitions. [2024-11-10 19:40:55,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:40:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 611 transitions. [2024-11-10 19:40:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 19:40:55,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:55,666 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:55,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 19:40:55,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:55,866 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_27_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:55,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:55,867 INFO L85 PathProgramCache]: Analyzing trace with hash -828436064, now seen corresponding path program 1 times [2024-11-10 19:40:55,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:55,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251901302] [2024-11-10 19:40:55,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:55,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:56,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:40:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:40:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:40:56,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:56,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251901302] [2024-11-10 19:40:56,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251901302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:56,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:56,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:40:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084610325] [2024-11-10 19:40:56,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:56,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:40:56,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:56,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:40:56,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:40:56,293 INFO L87 Difference]: Start difference. First operand 504 states and 611 transitions. Second operand has 8 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:57,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:57,232 INFO L93 Difference]: Finished difference Result 607 states and 627 transitions. [2024-11-10 19:40:57,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:40:57,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-10 19:40:57,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:57,234 INFO L225 Difference]: With dead ends: 607 [2024-11-10 19:40:57,234 INFO L226 Difference]: Without dead ends: 606 [2024-11-10 19:40:57,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-10 19:40:57,236 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 338 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:57,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 2078 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 19:40:57,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-10 19:40:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 504. [2024-11-10 19:40:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.661764705882353) internal successors, (565), 478 states have internal predecessors, (565), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 610 transitions. [2024-11-10 19:40:57,247 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 610 transitions. Word has length 56 [2024-11-10 19:40:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:57,247 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 610 transitions. [2024-11-10 19:40:57,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 610 transitions. [2024-11-10 19:40:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 19:40:57,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:57,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:57,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 19:40:57,247 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_27_to_39_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:57,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1558106562, now seen corresponding path program 1 times [2024-11-10 19:40:57,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:57,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731109949] [2024-11-10 19:40:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:57,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:57,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:57,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:40:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:57,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:40:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:40:57,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:57,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731109949] [2024-11-10 19:40:57,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731109949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:57,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:57,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:40:57,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626277988] [2024-11-10 19:40:57,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:57,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:40:57,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:57,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:40:57,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:40:57,364 INFO L87 Difference]: Start difference. First operand 504 states and 610 transitions. Second operand has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:57,513 INFO L93 Difference]: Finished difference Result 634 states and 654 transitions. [2024-11-10 19:40:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:40:57,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2024-11-10 19:40:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:57,515 INFO L225 Difference]: With dead ends: 634 [2024-11-10 19:40:57,515 INFO L226 Difference]: Without dead ends: 632 [2024-11-10 19:40:57,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:40:57,516 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 344 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:57,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1561 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:40:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-10 19:40:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 504. [2024-11-10 19:40:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6558823529411764) internal successors, (563), 478 states have internal predecessors, (563), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 608 transitions. [2024-11-10 19:40:57,526 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 608 transitions. Word has length 58 [2024-11-10 19:40:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 608 transitions. [2024-11-10 19:40:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 608 transitions. [2024-11-10 19:40:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 19:40:57,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:57,527 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:57,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 19:40:57,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:57,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:57,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1603181276, now seen corresponding path program 1 times [2024-11-10 19:40:57,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:57,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975268336] [2024-11-10 19:40:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:57,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:57,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:40:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:57,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:40:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:40:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:57,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975268336] [2024-11-10 19:40:57,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975268336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:57,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:57,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 19:40:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703338690] [2024-11-10 19:40:57,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:57,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 19:40:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 19:40:57,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:40:57,837 INFO L87 Difference]: Start difference. First operand 504 states and 608 transitions. Second operand has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:58,322 INFO L93 Difference]: Finished difference Result 604 states and 624 transitions. [2024-11-10 19:40:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:40:58,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2024-11-10 19:40:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:58,324 INFO L225 Difference]: With dead ends: 604 [2024-11-10 19:40:58,324 INFO L226 Difference]: Without dead ends: 603 [2024-11-10 19:40:58,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:40:58,325 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 348 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:58,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 2034 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:40:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-10 19:40:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 504. [2024-11-10 19:40:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6529411764705881) internal successors, (562), 478 states have internal predecessors, (562), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 607 transitions. [2024-11-10 19:40:58,334 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 607 transitions. Word has length 60 [2024-11-10 19:40:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:58,335 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 607 transitions. [2024-11-10 19:40:58,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 607 transitions. [2024-11-10 19:40:58,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 19:40:58,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:58,335 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:58,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 19:40:58,336 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_27_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:58,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:58,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1840987967, now seen corresponding path program 1 times [2024-11-10 19:40:58,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:58,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466206009] [2024-11-10 19:40:58,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:58,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:58,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:40:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:40:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:40:58,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:58,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466206009] [2024-11-10 19:40:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466206009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:58,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:58,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 19:40:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486309557] [2024-11-10 19:40:58,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:58,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 19:40:58,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:58,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 19:40:58,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:40:58,805 INFO L87 Difference]: Start difference. First operand 504 states and 607 transitions. Second operand has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:59,651 INFO L93 Difference]: Finished difference Result 603 states and 623 transitions. [2024-11-10 19:40:59,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:40:59,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 61 [2024-11-10 19:40:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:59,653 INFO L225 Difference]: With dead ends: 603 [2024-11-10 19:40:59,653 INFO L226 Difference]: Without dead ends: 601 [2024-11-10 19:40:59,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:40:59,654 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 344 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:59,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 2038 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 19:40:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-10 19:40:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 504. [2024-11-10 19:40:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6470588235294117) internal successors, (560), 478 states have internal predecessors, (560), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:40:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 605 transitions. [2024-11-10 19:40:59,664 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 605 transitions. Word has length 61 [2024-11-10 19:40:59,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:59,664 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 605 transitions. [2024-11-10 19:40:59,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:40:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 605 transitions. [2024-11-10 19:40:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 19:40:59,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:59,665 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:59,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 19:40:59,665 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_27_to_39_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:40:59,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:59,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1236052102, now seen corresponding path program 1 times [2024-11-10 19:40:59,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:59,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518921831] [2024-11-10 19:40:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:59,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:40:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:59,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:40:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:59,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:40:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:40:59,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518921831] [2024-11-10 19:40:59,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518921831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:59,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:59,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:40:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421370217] [2024-11-10 19:40:59,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:59,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:40:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:59,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:40:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:40:59,908 INFO L87 Difference]: Start difference. First operand 504 states and 605 transitions. Second operand has 7 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:41:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:00,236 INFO L93 Difference]: Finished difference Result 629 states and 649 transitions. [2024-11-10 19:41:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:41:00,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2024-11-10 19:41:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:00,238 INFO L225 Difference]: With dead ends: 629 [2024-11-10 19:41:00,238 INFO L226 Difference]: Without dead ends: 628 [2024-11-10 19:41:00,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:41:00,239 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 332 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:00,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1823 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:41:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-10 19:41:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 504. [2024-11-10 19:41:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6441176470588235) internal successors, (559), 478 states have internal predecessors, (559), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:41:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 604 transitions. [2024-11-10 19:41:00,249 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 604 transitions. Word has length 62 [2024-11-10 19:41:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:00,249 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 604 transitions. [2024-11-10 19:41:00,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 19:41:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 604 transitions. [2024-11-10 19:41:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 19:41:00,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:00,249 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:00,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 19:41:00,250 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_27_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:00,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash -424175864, now seen corresponding path program 1 times [2024-11-10 19:41:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:00,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916606937] [2024-11-10 19:41:00,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:41:00,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128784166] [2024-11-10 19:41:00,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:00,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:41:00,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:41:00,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:41:00,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 19:41:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:00,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 19:41:00,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:41:00,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 19:41:00,421 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-11-10 19:41:00,598 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 22 treesize of output 10 [2024-11-10 19:41:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:41:00,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:41:00,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:00,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916606937] [2024-11-10 19:41:00,678 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:41:00,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128784166] [2024-11-10 19:41:00,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128784166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:41:00,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:41:00,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-10 19:41:00,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941924887] [2024-11-10 19:41:00,679 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:41:00,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 19:41:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:00,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 19:41:00,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:41:00,680 INFO L87 Difference]: Start difference. First operand 504 states and 604 transitions. Second operand has 11 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:41:05,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 19:41:09,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 19:41:09,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:09,828 INFO L93 Difference]: Finished difference Result 640 states and 659 transitions. [2024-11-10 19:41:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 19:41:09,828 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 70 [2024-11-10 19:41:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:09,830 INFO L225 Difference]: With dead ends: 640 [2024-11-10 19:41:09,830 INFO L226 Difference]: Without dead ends: 639 [2024-11-10 19:41:09,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-11-10 19:41:09,831 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 474 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 20 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 2813 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:09,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 2813 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 539 Invalid, 3 Unknown, 0 Unchecked, 9.0s Time] [2024-11-10 19:41:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-10 19:41:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 504. [2024-11-10 19:41:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6411764705882352) internal successors, (558), 478 states have internal predecessors, (558), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:41:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 603 transitions. [2024-11-10 19:41:09,848 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 603 transitions. Word has length 70 [2024-11-10 19:41:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:09,849 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 603 transitions. [2024-11-10 19:41:09,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:41:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 603 transitions. [2024-11-10 19:41:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 19:41:09,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:09,849 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:09,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 19:41:10,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:41:10,054 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_27_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:10,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash -264549877, now seen corresponding path program 1 times [2024-11-10 19:41:10,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:10,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994529463] [2024-11-10 19:41:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:10,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:41:10,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248301583] [2024-11-10 19:41:10,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:10,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:41:10,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:41:10,085 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-11-10 19:41:10,086 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-11-10 19:41:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:10,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 19:41:10,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:41:10,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:41:10,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:41:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:41:10,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:41:15,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:15,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994529463] [2024-11-10 19:41:15,283 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:41:15,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248301583] [2024-11-10 19:41:15,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248301583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:41:15,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:41:15,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-10 19:41:15,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531272042] [2024-11-10 19:41:15,284 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:41:15,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 19:41:15,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:15,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 19:41:15,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=350, Unknown=1, NotChecked=0, Total=420 [2024-11-10 19:41:15,285 INFO L87 Difference]: Start difference. First operand 504 states and 603 transitions. Second operand has 18 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:41:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:16,306 INFO L93 Difference]: Finished difference Result 639 states and 658 transitions. [2024-11-10 19:41:16,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 19:41:16,306 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 71 [2024-11-10 19:41:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:16,308 INFO L225 Difference]: With dead ends: 639 [2024-11-10 19:41:16,308 INFO L226 Difference]: Without dead ends: 638 [2024-11-10 19:41:16,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=190, Invalid=801, Unknown=1, NotChecked=0, Total=992 [2024-11-10 19:41:16,309 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 493 mSDsluCounter, 3576 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 3850 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:16,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 3850 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 19:41:16,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-10 19:41:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 504. [2024-11-10 19:41:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.638235294117647) internal successors, (557), 478 states have internal predecessors, (557), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:41:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 602 transitions. [2024-11-10 19:41:16,324 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 602 transitions. Word has length 71 [2024-11-10 19:41:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:16,324 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 602 transitions. [2024-11-10 19:41:16,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.6875) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 19:41:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 602 transitions. [2024-11-10 19:41:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 19:41:16,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:16,325 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:16,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 19:41:16,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:41:16,530 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_27_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:16,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash -829360759, now seen corresponding path program 1 times [2024-11-10 19:41:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:16,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873179507] [2024-11-10 19:41:16,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:16,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:41:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:41:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:41:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 19:41:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:41:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:16,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873179507] [2024-11-10 19:41:16,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873179507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:41:16,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:41:16,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:41:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664881435] [2024-11-10 19:41:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:41:16,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:41:16,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:16,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:41:16,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:41:16,666 INFO L87 Difference]: Start difference. First operand 504 states and 602 transitions. Second operand has 6 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:41:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:16,829 INFO L93 Difference]: Finished difference Result 612 states and 632 transitions. [2024-11-10 19:41:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:41:16,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2024-11-10 19:41:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:16,831 INFO L225 Difference]: With dead ends: 612 [2024-11-10 19:41:16,831 INFO L226 Difference]: Without dead ends: 610 [2024-11-10 19:41:16,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:41:16,832 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 306 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:16,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1568 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:41:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-10 19:41:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 504. [2024-11-10 19:41:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6323529411764706) internal successors, (555), 478 states have internal predecessors, (555), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:41:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 600 transitions. [2024-11-10 19:41:16,841 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 600 transitions. Word has length 73 [2024-11-10 19:41:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:16,842 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 600 transitions. [2024-11-10 19:41:16,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:41:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 600 transitions. [2024-11-10 19:41:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 19:41:16,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:16,842 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:16,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 19:41:16,843 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_27_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:16,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:16,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1848228103, now seen corresponding path program 1 times [2024-11-10 19:41:16,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:16,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647734715] [2024-11-10 19:41:16,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:16,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:41:16,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [689519311] [2024-11-10 19:41:16,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:16,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:41:16,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:41:16,859 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-11-10 19:41:16,860 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-11-10 19:41:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:16,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 19:41:16,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:41:16,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:41:16,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:41:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:41:17,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:41:17,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:17,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647734715] [2024-11-10 19:41:17,668 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:41:17,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689519311] [2024-11-10 19:41:17,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689519311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:41:17,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:41:17,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-10 19:41:17,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124609438] [2024-11-10 19:41:17,668 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:41:17,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 19:41:17,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:17,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 19:41:17,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-10 19:41:17,669 INFO L87 Difference]: Start difference. First operand 504 states and 600 transitions. Second operand has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:41:18,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:18,296 INFO L93 Difference]: Finished difference Result 631 states and 650 transitions. [2024-11-10 19:41:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 19:41:18,297 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 75 [2024-11-10 19:41:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:18,299 INFO L225 Difference]: With dead ends: 631 [2024-11-10 19:41:18,299 INFO L226 Difference]: Without dead ends: 630 [2024-11-10 19:41:18,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2024-11-10 19:41:18,300 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 455 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 3040 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:18,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 3040 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:41:18,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-10 19:41:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 504. [2024-11-10 19:41:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6294117647058823) internal successors, (554), 478 states have internal predecessors, (554), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:41:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 599 transitions. [2024-11-10 19:41:18,310 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 599 transitions. Word has length 75 [2024-11-10 19:41:18,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:18,310 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 599 transitions. [2024-11-10 19:41:18,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:41:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 599 transitions. [2024-11-10 19:41:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 19:41:18,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:18,311 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:18,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 19:41:18,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:41:18,512 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_27_to_39_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:18,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:18,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1460496355, now seen corresponding path program 1 times [2024-11-10 19:41:18,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:18,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633322319] [2024-11-10 19:41:18,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:18,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:18,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:41:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:18,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:41:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:18,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:41:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:18,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 19:41:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:41:18,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:18,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633322319] [2024-11-10 19:41:18,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633322319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:41:18,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:41:18,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 19:41:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318794333] [2024-11-10 19:41:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:41:18,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:41:18,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:18,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:41:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:41:18,722 INFO L87 Difference]: Start difference. First operand 504 states and 599 transitions. Second operand has 7 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:41:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:19,309 INFO L93 Difference]: Finished difference Result 609 states and 629 transitions. [2024-11-10 19:41:19,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:41:19,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 76 [2024-11-10 19:41:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:19,311 INFO L225 Difference]: With dead ends: 609 [2024-11-10 19:41:19,311 INFO L226 Difference]: Without dead ends: 608 [2024-11-10 19:41:19,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:41:19,312 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 299 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:19,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1861 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 19:41:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-10 19:41:19,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 504. [2024-11-10 19:41:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6264705882352941) internal successors, (553), 478 states have internal predecessors, (553), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:41:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 598 transitions. [2024-11-10 19:41:19,322 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 598 transitions. Word has length 76 [2024-11-10 19:41:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:19,322 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 598 transitions. [2024-11-10 19:41:19,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:41:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 598 transitions. [2024-11-10 19:41:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 19:41:19,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:19,323 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:19,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 19:41:19,323 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_27_to_39_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:19,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:19,323 INFO L85 PathProgramCache]: Analyzing trace with hash -917308351, now seen corresponding path program 1 times [2024-11-10 19:41:19,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:19,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360200761] [2024-11-10 19:41:19,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:19,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:19,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:41:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:41:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:19,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:41:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:19,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 19:41:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 19:41:19,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:19,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360200761] [2024-11-10 19:41:19,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360200761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:41:19,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:41:19,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:41:19,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669283451] [2024-11-10 19:41:19,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:41:19,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:41:19,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:41:19,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:41:19,459 INFO L87 Difference]: Start difference. First operand 504 states and 598 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:41:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:19,609 INFO L93 Difference]: Finished difference Result 622 states and 642 transitions. [2024-11-10 19:41:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:41:19,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 78 [2024-11-10 19:41:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:19,611 INFO L225 Difference]: With dead ends: 622 [2024-11-10 19:41:19,611 INFO L226 Difference]: Without dead ends: 620 [2024-11-10 19:41:19,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:41:19,612 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 305 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:19,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1560 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:41:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-10 19:41:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 504. [2024-11-10 19:41:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 340 states have (on average 1.6205882352941177) internal successors, (551), 478 states have internal predecessors, (551), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:41:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 596 transitions. [2024-11-10 19:41:19,622 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 596 transitions. Word has length 78 [2024-11-10 19:41:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:19,623 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 596 transitions. [2024-11-10 19:41:19,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:41:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 596 transitions. [2024-11-10 19:41:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 19:41:19,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:19,624 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:19,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 19:41:19,624 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_27_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:19,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1065029473, now seen corresponding path program 1 times [2024-11-10 19:41:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:19,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084341331] [2024-11-10 19:41:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:41:19,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762274524] [2024-11-10 19:41:19,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:19,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:41:19,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:41:19,641 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-11-10 19:41:19,648 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-11-10 19:41:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:19,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 19:41:19,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:41:19,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:41:19,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 19:41:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:41:20,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:41:20,615 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 46 treesize of output 30 [2024-11-10 19:41:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 19:41:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084341331] [2024-11-10 19:41:20,701 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:41:20,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762274524] [2024-11-10 19:41:20,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762274524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:41:20,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:41:20,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2024-11-10 19:41:20,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518754838] [2024-11-10 19:41:20,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:41:20,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 19:41:20,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:20,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 19:41:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2024-11-10 19:41:20,702 INFO L87 Difference]: Start difference. First operand 504 states and 596 transitions. Second operand has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 21 states have internal predecessors, (129), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 19:41:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:22,140 INFO L93 Difference]: Finished difference Result 628 states and 648 transitions. [2024-11-10 19:41:22,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 19:41:22,140 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 21 states have internal predecessors, (129), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2024-11-10 19:41:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:22,143 INFO L225 Difference]: With dead ends: 628 [2024-11-10 19:41:22,143 INFO L226 Difference]: Without dead ends: 624 [2024-11-10 19:41:22,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 19:41:22,144 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 676 mSDsluCounter, 4425 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 4709 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:22,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 4709 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 19:41:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2024-11-10 19:41:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 503. [2024-11-10 19:41:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 340 states have (on average 1.6058823529411765) internal successors, (546), 477 states have internal predecessors, (546), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:41:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 591 transitions. [2024-11-10 19:41:22,158 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 591 transitions. Word has length 80 [2024-11-10 19:41:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:22,159 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 591 transitions. [2024-11-10 19:41:22,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 21 states have internal predecessors, (129), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-10 19:41:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 591 transitions. [2024-11-10 19:41:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 19:41:22,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:22,160 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 19:41:22,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 19:41:22,360 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,SelfDestructingSolverStorable24 [2024-11-10 19:41:22,360 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_27_to_39_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:22,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1232276689, now seen corresponding path program 1 times [2024-11-10 19:41:22,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:22,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433131117] [2024-11-10 19:41:22,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:22,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:41:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:41:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:41:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 19:41:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 19:41:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 19:41:22,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:22,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433131117] [2024-11-10 19:41:22,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433131117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:41:22,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:41:22,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:41:22,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553382647] [2024-11-10 19:41:22,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:41:22,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:41:22,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:22,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:41:22,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:41:22,489 INFO L87 Difference]: Start difference. First operand 503 states and 591 transitions. Second operand has 6 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:41:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:22,595 INFO L93 Difference]: Finished difference Result 508 states and 596 transitions. [2024-11-10 19:41:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:41:22,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 91 [2024-11-10 19:41:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:22,598 INFO L225 Difference]: With dead ends: 508 [2024-11-10 19:41:22,598 INFO L226 Difference]: Without dead ends: 506 [2024-11-10 19:41:22,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:41:22,599 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 73 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:22,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1645 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:41:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-10 19:41:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 505. [2024-11-10 19:41:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 342 states have (on average 1.6023391812865497) internal successors, (548), 479 states have internal predecessors, (548), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-10 19:41:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 593 transitions. [2024-11-10 19:41:22,610 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 593 transitions. Word has length 91 [2024-11-10 19:41:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:22,610 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 593 transitions. [2024-11-10 19:41:22,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:41:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 593 transitions. [2024-11-10 19:41:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 19:41:22,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:22,611 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:22,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 19:41:22,611 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:22,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:22,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1671402605, now seen corresponding path program 1 times [2024-11-10 19:41:22,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:22,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451138302] [2024-11-10 19:41:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:22,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:41:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:41:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 19:41:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 19:41:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 19:41:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:41:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 19:41:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451138302] [2024-11-10 19:41:22,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451138302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:41:22,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:41:22,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:41:22,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426193525] [2024-11-10 19:41:22,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:41:22,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:41:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:22,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:41:22,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:41:22,798 INFO L87 Difference]: Start difference. First operand 505 states and 593 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 19:41:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:22,951 INFO L93 Difference]: Finished difference Result 511 states and 595 transitions. [2024-11-10 19:41:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:41:22,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 94 [2024-11-10 19:41:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:22,953 INFO L225 Difference]: With dead ends: 511 [2024-11-10 19:41:22,953 INFO L226 Difference]: Without dead ends: 507 [2024-11-10 19:41:22,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:41:22,954 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 120 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:22,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1311 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:41:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-10 19:41:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2024-11-10 19:41:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 343 states have (on average 1.5889212827988337) internal successors, (545), 480 states have internal predecessors, (545), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-11-10 19:41:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 591 transitions. [2024-11-10 19:41:22,966 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 591 transitions. Word has length 94 [2024-11-10 19:41:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:22,966 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 591 transitions. [2024-11-10 19:41:22,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 19:41:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 591 transitions. [2024-11-10 19:41:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 19:41:22,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:22,967 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:22,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 19:41:22,967 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting func_to_recursive_line_27_to_39_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:22,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1669350144, now seen corresponding path program 1 times [2024-11-10 19:41:22,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:22,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607306830] [2024-11-10 19:41:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:22,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:41:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:41:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:41:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 19:41:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 19:41:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 19:41:23,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:23,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607306830] [2024-11-10 19:41:23,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607306830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:41:23,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:41:23,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:41:23,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080436125] [2024-11-10 19:41:23,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:41:23,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:41:23,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:23,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:41:23,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:41:23,205 INFO L87 Difference]: Start difference. First operand 507 states and 591 transitions. Second operand has 6 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:41:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:23,385 INFO L93 Difference]: Finished difference Result 583 states and 603 transitions. [2024-11-10 19:41:23,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:41:23,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 94 [2024-11-10 19:41:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:23,387 INFO L225 Difference]: With dead ends: 583 [2024-11-10 19:41:23,387 INFO L226 Difference]: Without dead ends: 581 [2024-11-10 19:41:23,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:41:23,387 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 232 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:23,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1564 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:41:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-10 19:41:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 510. [2024-11-10 19:41:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 346 states have (on average 1.583815028901734) internal successors, (548), 483 states have internal predecessors, (548), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-11-10 19:41:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 594 transitions. [2024-11-10 19:41:23,399 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 594 transitions. Word has length 94 [2024-11-10 19:41:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:23,400 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 594 transitions. [2024-11-10 19:41:23,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:41:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 594 transitions. [2024-11-10 19:41:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 19:41:23,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:23,401 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:23,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 19:41:23,401 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting func_to_recursive_line_27_to_39_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:23,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash 183801612, now seen corresponding path program 1 times [2024-11-10 19:41:23,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:23,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011864195] [2024-11-10 19:41:23,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:41:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:41:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:41:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 19:41:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 19:41:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 19:41:23,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011864195] [2024-11-10 19:41:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011864195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:41:23,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:41:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:41:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850326463] [2024-11-10 19:41:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:41:23,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:41:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:23,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:41:23,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:41:23,620 INFO L87 Difference]: Start difference. First operand 510 states and 594 transitions. Second operand has 6 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:41:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:23,806 INFO L93 Difference]: Finished difference Result 595 states and 615 transitions. [2024-11-10 19:41:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:41:23,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 97 [2024-11-10 19:41:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:23,809 INFO L225 Difference]: With dead ends: 595 [2024-11-10 19:41:23,809 INFO L226 Difference]: Without dead ends: 593 [2024-11-10 19:41:23,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:41:23,809 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 244 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:23,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1534 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:41:23,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-10 19:41:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 513. [2024-11-10 19:41:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 349 states have (on average 1.5787965616045845) internal successors, (551), 486 states have internal predecessors, (551), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-11-10 19:41:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 597 transitions. [2024-11-10 19:41:23,820 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 597 transitions. Word has length 97 [2024-11-10 19:41:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:23,820 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 597 transitions. [2024-11-10 19:41:23,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:41:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 597 transitions. [2024-11-10 19:41:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 19:41:23,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:23,821 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:23,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 19:41:23,821 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:23,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:23,822 INFO L85 PathProgramCache]: Analyzing trace with hash -449502181, now seen corresponding path program 1 times [2024-11-10 19:41:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:23,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608517310] [2024-11-10 19:41:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:23,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 19:41:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 19:41:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 19:41:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 19:41:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 19:41:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:41:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-10 19:41:23,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:41:23,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608517310] [2024-11-10 19:41:23,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608517310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:41:23,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:41:23,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:41:23,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805810411] [2024-11-10 19:41:23,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:41:23,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:41:23,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:41:23,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:41:23,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:41:23,949 INFO L87 Difference]: Start difference. First operand 513 states and 597 transitions. Second operand has 6 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:41:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:41:24,085 INFO L93 Difference]: Finished difference Result 607 states and 627 transitions. [2024-11-10 19:41:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:41:24,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 100 [2024-11-10 19:41:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:41:24,087 INFO L225 Difference]: With dead ends: 607 [2024-11-10 19:41:24,087 INFO L226 Difference]: Without dead ends: 605 [2024-11-10 19:41:24,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:41:24,088 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 256 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:41:24,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1580 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:41:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-10 19:41:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 516. [2024-11-10 19:41:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 352 states have (on average 1.5738636363636365) internal successors, (554), 489 states have internal predecessors, (554), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2024-11-10 19:41:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 600 transitions. [2024-11-10 19:41:24,099 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 600 transitions. Word has length 100 [2024-11-10 19:41:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:41:24,099 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 600 transitions. [2024-11-10 19:41:24,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 19:41:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 600 transitions. [2024-11-10 19:41:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 19:41:24,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:41:24,100 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:24,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 19:41:24,100 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2024-11-10 19:41:24,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:41:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash -837213463, now seen corresponding path program 1 times [2024-11-10 19:41:24,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:41:24,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045635488] [2024-11-10 19:41:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:41:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:41:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1002893181] [2024-11-10 19:41:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:41:24,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:41:24,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:41:24,120 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-11-10 19:41:24,121 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-11-10 19:41:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 19:41:24,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 19:41:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 19:41:24,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 19:41:24,287 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 19:41:24,287 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 138 remaining) [2024-11-10 19:41:24,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 138 remaining) [2024-11-10 19:41:24,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 138 remaining) [2024-11-10 19:41:24,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 138 remaining) [2024-11-10 19:41:24,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 138 remaining) [2024-11-10 19:41:24,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 138 remaining) [2024-11-10 19:41:24,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 138 remaining) [2024-11-10 19:41:24,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 138 remaining) [2024-11-10 19:41:24,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 138 remaining) [2024-11-10 19:41:24,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 138 remaining) [2024-11-10 19:41:24,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 138 remaining) [2024-11-10 19:41:24,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 138 remaining) [2024-11-10 19:41:24,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 138 remaining) [2024-11-10 19:41:24,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 138 remaining) [2024-11-10 19:41:24,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 138 remaining) [2024-11-10 19:41:24,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 138 remaining) [2024-11-10 19:41:24,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 138 remaining) [2024-11-10 19:41:24,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 138 remaining) [2024-11-10 19:41:24,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 138 remaining) [2024-11-10 19:41:24,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 138 remaining) [2024-11-10 19:41:24,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 138 remaining) [2024-11-10 19:41:24,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 138 remaining) [2024-11-10 19:41:24,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 138 remaining) [2024-11-10 19:41:24,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 138 remaining) [2024-11-10 19:41:24,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 138 remaining) [2024-11-10 19:41:24,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err24ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 138 remaining) [2024-11-10 19:41:24,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 138 remaining) [2024-11-10 19:41:24,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 138 remaining) [2024-11-10 19:41:24,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 138 remaining) [2024-11-10 19:41:24,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 138 remaining) [2024-11-10 19:41:24,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 138 remaining) [2024-11-10 19:41:24,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 138 remaining) [2024-11-10 19:41:24,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 138 remaining) [2024-11-10 19:41:24,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err32ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 138 remaining) [2024-11-10 19:41:24,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 138 remaining) [2024-11-10 19:41:24,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 138 remaining) [2024-11-10 19:41:24,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 138 remaining) [2024-11-10 19:41:24,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err36ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 138 remaining) [2024-11-10 19:41:24,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 138 remaining) [2024-11-10 19:41:24,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err38ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err39ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err40ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err41ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err44ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err46ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err47ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err48ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err50ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err51ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err52ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 138 remaining) [2024-11-10 19:41:24,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 138 remaining) [2024-11-10 19:41:24,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 138 remaining) [2024-11-10 19:41:24,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 138 remaining) [2024-11-10 19:41:24,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 138 remaining) [2024-11-10 19:41:24,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 138 remaining) [2024-11-10 19:41:24,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 138 remaining) [2024-11-10 19:41:24,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 138 remaining) [2024-11-10 19:41:24,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 138 remaining) [2024-11-10 19:41:24,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 138 remaining) [2024-11-10 19:41:24,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 138 remaining) [2024-11-10 19:41:24,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 138 remaining) [2024-11-10 19:41:24,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 138 remaining) [2024-11-10 19:41:24,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 138 remaining) [2024-11-10 19:41:24,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 138 remaining) [2024-11-10 19:41:24,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 138 remaining) [2024-11-10 19:41:24,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 138 remaining) [2024-11-10 19:41:24,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 138 remaining) [2024-11-10 19:41:24,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 138 remaining) [2024-11-10 19:41:24,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 138 remaining) [2024-11-10 19:41:24,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 138 remaining) [2024-11-10 19:41:24,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 138 remaining) [2024-11-10 19:41:24,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 138 remaining) [2024-11-10 19:41:24,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 138 remaining) [2024-11-10 19:41:24,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 138 remaining) [2024-11-10 19:41:24,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 138 remaining) [2024-11-10 19:41:24,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 138 remaining) [2024-11-10 19:41:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 138 remaining) [2024-11-10 19:41:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 138 remaining) [2024-11-10 19:41:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 138 remaining) [2024-11-10 19:41:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 138 remaining) [2024-11-10 19:41:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 138 remaining) [2024-11-10 19:41:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 138 remaining) [2024-11-10 19:41:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 138 remaining) [2024-11-10 19:41:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 138 remaining) [2024-11-10 19:41:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 138 remaining) [2024-11-10 19:41:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 138 remaining) [2024-11-10 19:41:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 138 remaining) [2024-11-10 19:41:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 138 remaining) [2024-11-10 19:41:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 138 remaining) [2024-11-10 19:41:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 138 remaining) [2024-11-10 19:41:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 138 remaining) [2024-11-10 19:41:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 138 remaining) [2024-11-10 19:41:24,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 19:41:24,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:41:24,503 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:41:24,562 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:41:24,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:41:24 BoogieIcfgContainer [2024-11-10 19:41:24,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:41:24,565 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:41:24,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:41:24,565 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:41:24,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:40:43" (3/4) ... [2024-11-10 19:41:24,566 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 19:41:24,615 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:41:24,615 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:41:24,616 INFO L158 Benchmark]: Toolchain (without parser) took 42924.54ms. Allocated memory was 243.3MB in the beginning and 494.9MB in the end (delta: 251.7MB). Free memory was 164.7MB in the beginning and 347.2MB in the end (delta: -182.5MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2024-11-10 19:41:24,616 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 121.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:41:24,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.96ms. Allocated memory is still 243.3MB. Free memory was 164.3MB in the beginning and 150.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 19:41:24,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.69ms. Allocated memory is still 243.3MB. Free memory was 150.6MB in the beginning and 148.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 19:41:24,616 INFO L158 Benchmark]: Boogie Preprocessor took 50.90ms. Allocated memory is still 243.3MB. Free memory was 148.2MB in the beginning and 145.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:41:24,616 INFO L158 Benchmark]: IcfgBuilder took 1128.96ms. Allocated memory is still 243.3MB. Free memory was 145.5MB in the beginning and 168.0MB in the end (delta: -22.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-10 19:41:24,617 INFO L158 Benchmark]: TraceAbstraction took 41416.51ms. Allocated memory was 243.3MB in the beginning and 494.9MB in the end (delta: 251.7MB). Free memory was 166.8MB in the beginning and 355.6MB in the end (delta: -188.7MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2024-11-10 19:41:24,617 INFO L158 Benchmark]: Witness Printer took 50.10ms. Allocated memory is still 494.9MB. Free memory was 355.6MB in the beginning and 347.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 19:41:24,618 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71ms. Allocated memory is still 121.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.96ms. Allocated memory is still 243.3MB. Free memory was 164.3MB in the beginning and 150.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.69ms. Allocated memory is still 243.3MB. Free memory was 150.6MB in the beginning and 148.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.90ms. Allocated memory is still 243.3MB. Free memory was 148.2MB in the beginning and 145.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1128.96ms. Allocated memory is still 243.3MB. Free memory was 145.5MB in the beginning and 168.0MB in the end (delta: -22.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41416.51ms. Allocated memory was 243.3MB in the beginning and 494.9MB in the end (delta: 251.7MB). Free memory was 166.8MB in the beginning and 355.6MB in the end (delta: -188.7MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. * Witness Printer took 50.10ms. Allocated memory is still 494.9MB. Free memory was 355.6MB in the beginning and 347.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 94]: integer overflow possible integer overflow possible We found a FailurePath: [L82] int a; [L83] int n; [L84] int x; [L85] int y; [L86] int z; [L87] a = __VERIFIER_nondet_int() [L88] n = 0 [L89] x = 0 [L90] y = 1 [L91] z = 6 [L92] CALL func_to_recursive_line_27_to_39_0(&y, &x, &z, &n, &a) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}] [L53] COND TRUE 1 [L56] EXPR \read(*z) [L56] EXPR \read(*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L56] EXPR 6 * (*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L56] EXPR (6 * (*n)) + 6 VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L56] CALL __VERIFIER_assert((*z) == ((6 * (*n)) + 6)) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L56] RET __VERIFIER_assert((*z) == ((6 * (*n)) + 6)) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L57] EXPR \read(*y) [L57] EXPR \read(*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L57] EXPR 3 * (*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L57] EXPR \read(*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L57] EXPR (3 * (*n)) * (*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L57] EXPR \read(*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L57] EXPR 3 * (*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L57] EXPR ((3 * (*n)) * (*n)) + (3 * (*n)) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L57] EXPR (((3 * (*n)) * (*n)) + (3 * (*n))) + 1 VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L57] CALL __VERIFIER_assert((*y) == ((((3 * (*n)) * (*n)) + (3 * (*n))) + 1)) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET __VERIFIER_assert((*y) == ((((3 * (*n)) * (*n)) + (3 * (*n))) + 1)) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L58] EXPR \read(*x) [L58] EXPR \read(*n) [L58] EXPR \read(*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L58] EXPR (*n) * (*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L58] EXPR \read(*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L58] EXPR ((*n) * (*n)) * (*n) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L58] CALL __VERIFIER_assert((*x) == (((*n) * (*n)) * (*n))) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET __VERIFIER_assert((*x) == (((*n) * (*n)) * (*n))) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR \read(*y) [L59] EXPR \read(*z) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR (*y) * (*z) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR \read(*x) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR 18 * (*x) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR ((*y) * (*z)) - (18 * (*x)) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR \read(*y) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR 12 * (*y) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR (((*y) * (*z)) - (18 * (*x))) - (12 * (*y)) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR \read(*z) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR 2 * (*z) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR ((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z)) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] EXPR (((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6 VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L59] CALL __VERIFIER_assert(((((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6) == 0) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L59] RET __VERIFIER_assert(((((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6) == 0) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L60] EXPR \read(*z) [L60] EXPR \read(*z) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L60] EXPR (*z) * (*z) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L60] EXPR \read(*y) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L60] EXPR 12 * (*y) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L60] EXPR ((*z) * (*z)) - (12 * (*y)) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L60] EXPR \read(*z) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L60] EXPR 6 * (*z) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L60] EXPR (((*z) * (*z)) - (12 * (*y))) - (6 * (*z)) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L60] EXPR ((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12 VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L60] CALL __VERIFIER_assert((((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12) == 0) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert((((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12) == 0) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L61] EXPR \read(*n) [L61] EXPR \read(*a) VAL [\old(a)={8:0}, \old(n)={4:0}, \old(x)={7:0}, \old(y)={9:0}, \old(z)={6:0}, a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L61] COND TRUE !((*n) <= (*a)) [L92] RET func_to_recursive_line_27_to_39_0(&y, &x, &z, &n, &a) VAL [a={8:0}, n={4:0}, x={7:0}, y={9:0}, z={6:0}] [L93] EXPR \read(z) [L93] EXPR \read(n) [L93] EXPR 6 * n VAL [a={8:0}, x={7:0}, y={9:0}, z={6:0}] [L93] EXPR (6 * n) + 6 VAL [a={8:0}, x={7:0}, y={9:0}, z={6:0}] [L93] CALL __VERIFIER_assert(z == ((6 * n) + 6)) [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(z == ((6 * n) + 6)) VAL [a={8:0}, x={7:0}, y={9:0}, z={6:0}] [L94] EXPR \read(a) [L94] 6 * a VAL [a={8:0}, x={7:0}, y={9:0}, z={6:0}] - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 346 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 41.3s, OverallIterations: 31, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 10593 SdHoareTripleChecker+Valid, 17.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10481 mSDsluCounter, 59311 SdHoareTripleChecker+Invalid, 16.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49943 mSDsCounter, 444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9448 IncrementalHoareTripleChecker+Invalid, 9895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 444 mSolverCounterUnsat, 9368 mSDtfsCounter, 9448 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 953 GetRequests, 600 SyntacticMatches, 34 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=516occurred in iteration=30, InterpolantAutomatonStates: 247, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 2845 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 2455 NumberOfCodeBlocks, 2455 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1820 ConstructedInterpolants, 260 QuantifiedInterpolants, 20054 SizeOfPredicates, 128 NumberOfNonLiveVariables, 1857 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 483/540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 19:41:24,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)